/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 04:22:30,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 04:22:30,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 04:22:30,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 04:22:30,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 04:22:30,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 04:22:30,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 04:22:30,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 04:22:30,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 04:22:30,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 04:22:30,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 04:22:30,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 04:22:30,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 04:22:30,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 04:22:30,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 04:22:30,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 04:22:30,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 04:22:30,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 04:22:30,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 04:22:30,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 04:22:30,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 04:22:30,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 04:22:30,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 04:22:30,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 04:22:30,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 04:22:30,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 04:22:30,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 04:22:30,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 04:22:30,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 04:22:30,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 04:22:30,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 04:22:30,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 04:22:30,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 04:22:30,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 04:22:30,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 04:22:30,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 04:22:30,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 04:22:30,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 04:22:30,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 04:22:30,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 04:22:30,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 04:22:30,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 04:22:30,434 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 04:22:30,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 04:22:30,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 04:22:30,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 04:22:30,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 04:22:30,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 04:22:30,438 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 04:22:30,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 04:22:30,439 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 04:22:30,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 04:22:30,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 04:22:30,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 04:22:30,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 04:22:30,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 04:22:30,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 04:22:30,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 04:22:30,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 04:22:30,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 04:22:30,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 04:22:30,777 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 04:22:30,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl [2021-06-05 04:22:30,789 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl' [2021-06-05 04:22:30,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 04:22:30,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 04:22:30,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 04:22:30,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 04:22:30,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 04:22:30,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 04:22:30,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 04:22:30,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 04:22:30,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 04:22:30,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/1) ... [2021-06-05 04:22:30,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 04:22:30,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 04:22:30,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 04:22:30,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 04:22:30,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (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 [2021-06-05 04:22:30,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 04:22:30,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 04:22:30,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 04:22:30,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 04:22:30,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 04:22:30,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 04:22:30,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 04:22:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 04:22:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 04:22:30,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 04:22:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 04:22:30,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 04:22:30,968 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 04:22:31,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 04:22:31,291 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 04:22:31,294 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2021-06-05 04:22:31,294 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2021-06-05 04:22:31,294 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2021-06-05 04:22:31,295 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 04:22:31 BoogieIcfgContainer [2021-06-05 04:22:31,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 04:22:31,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 04:22:31,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 04:22:31,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 04:22:31,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 04:22:30" (1/2) ... [2021-06-05 04:22:31,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513faa8a and model type array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 04:22:31, skipping insertion in model container [2021-06-05 04:22:31,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 04:22:31" (2/2) ... [2021-06-05 04:22:31,313 INFO L111 eAbstractionObserver]: Analyzing ICFG array-int-subst.wvr.bpl [2021-06-05 04:22:31,317 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 04:22:31,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 04:22:31,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 04:22:31,318 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 04:22:31,352 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 04:22:31,370 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 04:22:31,398 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 04:22:31,398 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 04:22:31,398 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 04:22:31,399 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 04:22:31,399 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 04:22:31,399 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 04:22:31,399 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 04:22:31,399 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 04:22:31,407 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 68 flow [2021-06-05 04:22:31,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:31,430 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:31,431 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:31,431 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2084068600, now seen corresponding path program 1 times [2021-06-05 04:22:31,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:31,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904301593] [2021-06-05 04:22:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:31,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:31,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904301593] [2021-06-05 04:22:31,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904301593] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:31,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:31,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:31,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759860027] [2021-06-05 04:22:31,651 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:31,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:31,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:31,668 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:31,819 INFO L93 Difference]: Finished difference Result 139 states and 379 transitions. [2021-06-05 04:22:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:31,834 INFO L225 Difference]: With dead ends: 139 [2021-06-05 04:22:31,834 INFO L226 Difference]: Without dead ends: 135 [2021-06-05 04:22:31,835 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-06-05 04:22:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 84. [2021-06-05 04:22:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.819277108433735) internal successors, (234), 83 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 234 transitions. [2021-06-05 04:22:31,895 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 234 transitions. Word has length 14 [2021-06-05 04:22:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:31,896 INFO L482 AbstractCegarLoop]: Abstraction has 84 states and 234 transitions. [2021-06-05 04:22:31,896 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 234 transitions. [2021-06-05 04:22:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:31,899 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:31,900 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:31,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 04:22:31,900 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1063669592, now seen corresponding path program 2 times [2021-06-05 04:22:31,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:31,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32339358] [2021-06-05 04:22:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:31,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:31,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32339358] [2021-06-05 04:22:31,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32339358] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:31,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:31,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:31,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180201080] [2021-06-05 04:22:31,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:32,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:32,003 INFO L87 Difference]: Start difference. First operand 84 states and 234 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:32,120 INFO L93 Difference]: Finished difference Result 156 states and 429 transitions. [2021-06-05 04:22:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:32,123 INFO L225 Difference]: With dead ends: 156 [2021-06-05 04:22:32,124 INFO L226 Difference]: Without dead ends: 152 [2021-06-05 04:22:32,124 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-06-05 04:22:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-06-05 04:22:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.831460674157303) internal successors, (252), 89 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 252 transitions. [2021-06-05 04:22:32,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 252 transitions. Word has length 14 [2021-06-05 04:22:32,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:32,144 INFO L482 AbstractCegarLoop]: Abstraction has 90 states and 252 transitions. [2021-06-05 04:22:32,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 252 transitions. [2021-06-05 04:22:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:32,146 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:32,146 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:32,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 04:22:32,147 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash 284971666, now seen corresponding path program 3 times [2021-06-05 04:22:32,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:32,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285899875] [2021-06-05 04:22:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:32,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:32,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285899875] [2021-06-05 04:22:32,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285899875] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:32,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:32,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:32,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028618722] [2021-06-05 04:22:32,240 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:32,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:32,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:32,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:32,242 INFO L87 Difference]: Start difference. First operand 90 states and 252 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:32,340 INFO L93 Difference]: Finished difference Result 169 states and 467 transitions. [2021-06-05 04:22:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:32,345 INFO L225 Difference]: With dead ends: 169 [2021-06-05 04:22:32,346 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 04:22:32,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 04:22:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 94. [2021-06-05 04:22:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.838709677419355) internal successors, (264), 93 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 264 transitions. [2021-06-05 04:22:32,365 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 264 transitions. Word has length 14 [2021-06-05 04:22:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:32,365 INFO L482 AbstractCegarLoop]: Abstraction has 94 states and 264 transitions. [2021-06-05 04:22:32,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 264 transitions. [2021-06-05 04:22:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:32,366 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:32,366 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:32,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 04:22:32,366 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -791726200, now seen corresponding path program 4 times [2021-06-05 04:22:32,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:32,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790219123] [2021-06-05 04:22:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:32,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:32,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790219123] [2021-06-05 04:22:32,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790219123] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:32,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:32,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:32,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171337400] [2021-06-05 04:22:32,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:32,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:32,445 INFO L87 Difference]: Start difference. First operand 94 states and 264 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:32,552 INFO L93 Difference]: Finished difference Result 173 states and 479 transitions. [2021-06-05 04:22:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:32,554 INFO L225 Difference]: With dead ends: 173 [2021-06-05 04:22:32,554 INFO L226 Difference]: Without dead ends: 169 [2021-06-05 04:22:32,554 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-06-05 04:22:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2021-06-05 04:22:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.845360824742268) internal successors, (276), 97 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 276 transitions. [2021-06-05 04:22:32,559 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 276 transitions. Word has length 14 [2021-06-05 04:22:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:32,559 INFO L482 AbstractCegarLoop]: Abstraction has 98 states and 276 transitions. [2021-06-05 04:22:32,560 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 276 transitions. [2021-06-05 04:22:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:32,561 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:32,561 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:32,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 04:22:32,561 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1403359368, now seen corresponding path program 5 times [2021-06-05 04:22:32,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:32,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050151409] [2021-06-05 04:22:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:32,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:32,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050151409] [2021-06-05 04:22:32,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050151409] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:32,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:32,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:32,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277087410] [2021-06-05 04:22:32,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:32,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:32,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:32,664 INFO L87 Difference]: Start difference. First operand 98 states and 276 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:32,750 INFO L93 Difference]: Finished difference Result 176 states and 489 transitions. [2021-06-05 04:22:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:32,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:32,752 INFO L225 Difference]: With dead ends: 176 [2021-06-05 04:22:32,752 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 04:22:32,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 04:22:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 100. [2021-06-05 04:22:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 04:22:32,767 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 04:22:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:32,767 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 04:22:32,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 04:22:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 04:22:32,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:32,771 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:32,771 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 04:22:32,771 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:32,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1756874686, now seen corresponding path program 6 times [2021-06-05 04:22:32,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:32,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330649672] [2021-06-05 04:22:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:32,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:32,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330649672] [2021-06-05 04:22:32,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330649672] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:22:32,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:22:32,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 04:22:32,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011210552] [2021-06-05 04:22:32,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 04:22:32,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 04:22:32,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 04:22:32,842 INFO L87 Difference]: Start difference. First operand 100 states and 282 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:32,927 INFO L93 Difference]: Finished difference Result 174 states and 483 transitions. [2021-06-05 04:22:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 04:22:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-06-05 04:22:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:32,929 INFO L225 Difference]: With dead ends: 174 [2021-06-05 04:22:32,929 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 04:22:32,929 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:22:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 04:22:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2021-06-05 04:22:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 04:22:32,940 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 04:22:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:32,942 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 04:22:32,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 04:22:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:32,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:32,945 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:32,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 04:22:32,945 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1483038554, now seen corresponding path program 1 times [2021-06-05 04:22:32,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:32,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345733558] [2021-06-05 04:22:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:33,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:33,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345733558] [2021-06-05 04:22:33,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345733558] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:33,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057848596] [2021-06-05 04:22:33,041 INFO L95 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 [2021-06-05 04:22:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:33,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:33,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:33,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057848596] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:33,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:33,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:33,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561193044] [2021-06-05 04:22:33,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:33,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:33,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:33,245 INFO L87 Difference]: Start difference. First operand 100 states and 282 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:33,730 INFO L93 Difference]: Finished difference Result 239 states and 656 transitions. [2021-06-05 04:22:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:22:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:33,732 INFO L225 Difference]: With dead ends: 239 [2021-06-05 04:22:33,732 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 04:22:33,733 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 365.8ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:22:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 04:22:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 123. [2021-06-05 04:22:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.9836065573770494) internal successors, (364), 122 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 364 transitions. [2021-06-05 04:22:33,742 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 364 transitions. Word has length 15 [2021-06-05 04:22:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:33,742 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 364 transitions. [2021-06-05 04:22:33,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 364 transitions. [2021-06-05 04:22:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:33,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:33,744 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:33,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 04:22:33,957 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash -180956976, now seen corresponding path program 1 times [2021-06-05 04:22:33,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:33,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418740866] [2021-06-05 04:22:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:34,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:34,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418740866] [2021-06-05 04:22:34,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418740866] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:34,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343456374] [2021-06-05 04:22:34,014 INFO L95 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 [2021-06-05 04:22:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:34,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:34,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:34,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343456374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:34,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:34,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:34,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990356816] [2021-06-05 04:22:34,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:34,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:34,188 INFO L87 Difference]: Start difference. First operand 123 states and 364 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:34,782 INFO L93 Difference]: Finished difference Result 257 states and 669 transitions. [2021-06-05 04:22:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 04:22:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:34,784 INFO L225 Difference]: With dead ends: 257 [2021-06-05 04:22:34,784 INFO L226 Difference]: Without dead ends: 187 [2021-06-05 04:22:34,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 477.3ms TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:22:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-06-05 04:22:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2021-06-05 04:22:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 04:22:34,790 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 15 [2021-06-05 04:22:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:34,790 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 04:22:34,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 04:22:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:34,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:34,791 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:35,013 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:35,013 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash 479848854, now seen corresponding path program 1 times [2021-06-05 04:22:35,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:35,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135010744] [2021-06-05 04:22:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:35,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:35,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135010744] [2021-06-05 04:22:35,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135010744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:35,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736164805] [2021-06-05 04:22:35,090 INFO L95 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 [2021-06-05 04:22:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:35,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:35,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:35,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736164805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:35,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:35,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:35,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962327531] [2021-06-05 04:22:35,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:35,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:35,256 INFO L87 Difference]: Start difference. First operand 133 states and 387 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:35,495 INFO L93 Difference]: Finished difference Result 187 states and 522 transitions. [2021-06-05 04:22:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:35,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:35,497 INFO L225 Difference]: With dead ends: 187 [2021-06-05 04:22:35,497 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 04:22:35,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 04:22:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2021-06-05 04:22:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.9305555555555554) internal successors, (422), 144 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 422 transitions. [2021-06-05 04:22:35,508 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 422 transitions. Word has length 15 [2021-06-05 04:22:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:35,508 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 422 transitions. [2021-06-05 04:22:35,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 422 transitions. [2021-06-05 04:22:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:35,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:35,509 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:35,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 04:22:35,728 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1061667084, now seen corresponding path program 2 times [2021-06-05 04:22:35,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:35,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595023676] [2021-06-05 04:22:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:35,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:35,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595023676] [2021-06-05 04:22:35,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595023676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:35,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094543834] [2021-06-05 04:22:35,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2021-06-05 04:22:35,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:35,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:35,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:35,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:35,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094543834] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:35,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:35,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:35,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109598904] [2021-06-05 04:22:35,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:35,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:35,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:35,962 INFO L87 Difference]: Start difference. First operand 145 states and 422 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:36,138 INFO L93 Difference]: Finished difference Result 197 states and 554 transitions. [2021-06-05 04:22:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:36,140 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:22:36,140 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 04:22:36,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 172.5ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 04:22:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2021-06-05 04:22:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.952054794520548) internal successors, (431), 146 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 431 transitions. [2021-06-05 04:22:36,146 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 431 transitions. Word has length 15 [2021-06-05 04:22:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:36,146 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 431 transitions. [2021-06-05 04:22:36,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 431 transitions. [2021-06-05 04:22:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:36,147 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:36,147 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:36,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 04:22:36,361 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash -667380250, now seen corresponding path program 3 times [2021-06-05 04:22:36,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:36,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912525790] [2021-06-05 04:22:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:36,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:36,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912525790] [2021-06-05 04:22:36,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912525790] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:36,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274333699] [2021-06-05 04:22:36,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2021-06-05 04:22:36,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:36,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:36,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:36,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:36,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274333699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:36,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:36,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:22:36,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942543626] [2021-06-05 04:22:36,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:22:36,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:36,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:22:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:22:36,531 INFO L87 Difference]: Start difference. First operand 147 states and 431 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:36,690 INFO L93 Difference]: Finished difference Result 209 states and 593 transitions. [2021-06-05 04:22:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:36,693 INFO L225 Difference]: With dead ends: 209 [2021-06-05 04:22:36,693 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 04:22:36,693 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 91.2ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 04:22:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 153. [2021-06-05 04:22:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 04:22:36,706 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 04:22:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:36,707 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 04:22:36,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 04:22:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:36,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:36,708 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:36,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 04:22:36,921 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1754797532, now seen corresponding path program 4 times [2021-06-05 04:22:36,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:36,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903983128] [2021-06-05 04:22:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:36,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:36,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903983128] [2021-06-05 04:22:36,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903983128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:36,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403533489] [2021-06-05 04:22:36,996 INFO L93 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 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 [2021-06-05 04:22:37,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:37,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:37,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:37,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:37,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403533489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:37,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:37,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:37,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796405541] [2021-06-05 04:22:37,141 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:37,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:37,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:37,142 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:37,397 INFO L93 Difference]: Finished difference Result 276 states and 751 transitions. [2021-06-05 04:22:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:37,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:37,399 INFO L225 Difference]: With dead ends: 276 [2021-06-05 04:22:37,399 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 04:22:37,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 260.2ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 04:22:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 04:22:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 04:22:37,406 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 04:22:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:37,407 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 04:22:37,407 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 04:22:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:37,407 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:37,408 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:37,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:37,621 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351534, now seen corresponding path program 5 times [2021-06-05 04:22:37,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:37,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140631496] [2021-06-05 04:22:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:37,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:37,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140631496] [2021-06-05 04:22:37,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140631496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:37,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107183846] [2021-06-05 04:22:37,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2021-06-05 04:22:37,731 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:37,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:37,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:37,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:37,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107183846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:37,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:37,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:37,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581998034] [2021-06-05 04:22:37,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:37,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:37,838 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:38,056 INFO L93 Difference]: Finished difference Result 276 states and 772 transitions. [2021-06-05 04:22:38,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:38,058 INFO L225 Difference]: With dead ends: 276 [2021-06-05 04:22:38,058 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 04:22:38,059 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 223.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 04:22:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 04:22:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 04:22:38,065 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 04:22:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:38,066 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 04:22:38,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 04:22:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:38,066 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:38,066 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:38,280 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-05 04:22:38,281 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1013363858, now seen corresponding path program 6 times [2021-06-05 04:22:38,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:38,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452434869] [2021-06-05 04:22:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:38,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:38,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452434869] [2021-06-05 04:22:38,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452434869] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:38,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181743328] [2021-06-05 04:22:38,352 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2021-06-05 04:22:38,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:38,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:38,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 04:22:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:38,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181743328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:38,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:38,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:38,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525807897] [2021-06-05 04:22:38,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:38,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:38,492 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:39,172 INFO L93 Difference]: Finished difference Result 275 states and 748 transitions. [2021-06-05 04:22:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:22:39,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:39,174 INFO L225 Difference]: With dead ends: 275 [2021-06-05 04:22:39,174 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 04:22:39,174 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 563.1ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:22:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 04:22:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 153. [2021-06-05 04:22:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 04:22:39,181 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 04:22:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:39,181 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 04:22:39,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 04:22:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:39,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:39,182 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:39,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 04:22:39,397 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 261780050, now seen corresponding path program 7 times [2021-06-05 04:22:39,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:39,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653379823] [2021-06-05 04:22:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:39,477 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:39,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653379823] [2021-06-05 04:22:39,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653379823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:39,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653982294] [2021-06-05 04:22:39,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2021-06-05 04:22:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:39,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:39,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:39,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653982294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:39,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:39,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:39,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475287643] [2021-06-05 04:22:39,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:39,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:39,594 INFO L87 Difference]: Start difference. First operand 153 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:39,856 INFO L93 Difference]: Finished difference Result 206 states and 576 transitions. [2021-06-05 04:22:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:39,858 INFO L225 Difference]: With dead ends: 206 [2021-06-05 04:22:39,858 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 04:22:39,858 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 236.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 04:22:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2021-06-05 04:22:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.947712418300654) internal successors, (451), 153 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 451 transitions. [2021-06-05 04:22:39,863 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 451 transitions. Word has length 15 [2021-06-05 04:22:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:39,864 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 451 transitions. [2021-06-05 04:22:39,864 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 451 transitions. [2021-06-05 04:22:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:39,864 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:39,865 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:40,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 04:22:40,077 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 970590554, now seen corresponding path program 2 times [2021-06-05 04:22:40,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:40,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163988399] [2021-06-05 04:22:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:40,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:40,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163988399] [2021-06-05 04:22:40,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163988399] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:40,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540136930] [2021-06-05 04:22:40,114 INFO L93 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 [2021-06-05 04:22:40,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:40,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:40,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:40,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:40,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540136930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:40,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:40,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:40,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981870595] [2021-06-05 04:22:40,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:40,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:40,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:40,241 INFO L87 Difference]: Start difference. First operand 154 states and 451 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:40,670 INFO L93 Difference]: Finished difference Result 315 states and 839 transitions. [2021-06-05 04:22:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:22:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:40,675 INFO L225 Difference]: With dead ends: 315 [2021-06-05 04:22:40,676 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 04:22:40,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 315.1ms TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:22:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 04:22:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 168. [2021-06-05 04:22:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0479041916167664) internal successors, (509), 167 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 509 transitions. [2021-06-05 04:22:40,684 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 509 transitions. Word has length 15 [2021-06-05 04:22:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:40,684 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 509 transitions. [2021-06-05 04:22:40,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 509 transitions. [2021-06-05 04:22:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:40,685 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:40,685 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:40,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:40,906 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash 511164902, now seen corresponding path program 8 times [2021-06-05 04:22:40,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:40,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281475710] [2021-06-05 04:22:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:40,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:40,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281475710] [2021-06-05 04:22:40,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281475710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:40,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717697543] [2021-06-05 04:22:40,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:41,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:41,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:41,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:41,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:41,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717697543] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:41,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:41,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:41,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205530386] [2021-06-05 04:22:41,099 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:41,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:41,099 INFO L87 Difference]: Start difference. First operand 168 states and 509 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:41,339 INFO L93 Difference]: Finished difference Result 259 states and 742 transitions. [2021-06-05 04:22:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:41,341 INFO L225 Difference]: With dead ends: 259 [2021-06-05 04:22:41,341 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 04:22:41,341 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 218.0ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 04:22:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 170. [2021-06-05 04:22:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.059171597633136) internal successors, (517), 169 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 517 transitions. [2021-06-05 04:22:41,348 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 517 transitions. Word has length 15 [2021-06-05 04:22:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:41,348 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 517 transitions. [2021-06-05 04:22:41,348 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 517 transitions. [2021-06-05 04:22:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:41,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:41,349 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:41,560 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 04:22:41,561 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1191223272, now seen corresponding path program 2 times [2021-06-05 04:22:41,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:41,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020448795] [2021-06-05 04:22:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:41,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:41,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020448795] [2021-06-05 04:22:41,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020448795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:41,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895719251] [2021-06-05 04:22:41,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_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 [2021-06-05 04:22:41,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:41,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:41,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:41,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:41,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895719251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:41,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:41,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:41,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181443843] [2021-06-05 04:22:41,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:41,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:41,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:41,735 INFO L87 Difference]: Start difference. First operand 170 states and 517 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:41,993 INFO L93 Difference]: Finished difference Result 263 states and 728 transitions. [2021-06-05 04:22:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:22:41,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:41,995 INFO L225 Difference]: With dead ends: 263 [2021-06-05 04:22:41,995 INFO L226 Difference]: Without dead ends: 236 [2021-06-05 04:22:41,995 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 182.8ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-06-05 04:22:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2021-06-05 04:22:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.029585798816568) internal successors, (512), 169 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 512 transitions. [2021-06-05 04:22:42,001 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 512 transitions. Word has length 15 [2021-06-05 04:22:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:42,001 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 512 transitions. [2021-06-05 04:22:42,001 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 512 transitions. [2021-06-05 04:22:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:42,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:42,002 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:42,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 04:22:42,225 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1872721008, now seen corresponding path program 9 times [2021-06-05 04:22:42,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:42,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940590903] [2021-06-05 04:22:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:42,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:42,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940590903] [2021-06-05 04:22:42,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940590903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:42,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623230336] [2021-06-05 04:22:42,299 INFO L93 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 [2021-06-05 04:22:42,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:42,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:42,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:42,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623230336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:42,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:42,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:42,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011632684] [2021-06-05 04:22:42,440 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:42,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:42,441 INFO L87 Difference]: Start difference. First operand 170 states and 512 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:42,734 INFO L93 Difference]: Finished difference Result 230 states and 654 transitions. [2021-06-05 04:22:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:42,736 INFO L225 Difference]: With dead ends: 230 [2021-06-05 04:22:42,736 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 04:22:42,736 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 281.2ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 04:22:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 170. [2021-06-05 04:22:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.0236686390532546) internal successors, (511), 169 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 511 transitions. [2021-06-05 04:22:42,742 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 511 transitions. Word has length 15 [2021-06-05 04:22:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:42,742 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 511 transitions. [2021-06-05 04:22:42,742 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 511 transitions. [2021-06-05 04:22:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:42,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:42,743 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:42,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 04:22:42,953 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1743627284, now seen corresponding path program 3 times [2021-06-05 04:22:42,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:42,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111406291] [2021-06-05 04:22:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:42,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:42,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111406291] [2021-06-05 04:22:42,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111406291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:42,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635113616] [2021-06-05 04:22:42,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:43,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:43,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:43,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:43,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:43,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635113616] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:43,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:43,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:43,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261752722] [2021-06-05 04:22:43,113 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:43,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:43,113 INFO L87 Difference]: Start difference. First operand 170 states and 511 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:43,429 INFO L93 Difference]: Finished difference Result 284 states and 758 transitions. [2021-06-05 04:22:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:22:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:43,431 INFO L225 Difference]: With dead ends: 284 [2021-06-05 04:22:43,431 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 04:22:43,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 222.6ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:22:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 04:22:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 159. [2021-06-05 04:22:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0) internal successors, (474), 158 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 474 transitions. [2021-06-05 04:22:43,436 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 474 transitions. Word has length 15 [2021-06-05 04:22:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:43,437 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 474 transitions. [2021-06-05 04:22:43,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 474 transitions. [2021-06-05 04:22:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:43,437 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:43,438 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:43,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:43,638 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1421782062, now seen corresponding path program 10 times [2021-06-05 04:22:43,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:43,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439520471] [2021-06-05 04:22:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:43,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:43,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439520471] [2021-06-05 04:22:43,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439520471] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:43,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420203223] [2021-06-05 04:22:43,679 INFO L93 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:43,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:43,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:43,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:43,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:43,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420203223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:43,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:43,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:22:43,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297583180] [2021-06-05 04:22:43,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:43,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:43,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:43,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:43,779 INFO L87 Difference]: Start difference. First operand 159 states and 474 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:43,917 INFO L93 Difference]: Finished difference Result 254 states and 734 transitions. [2021-06-05 04:22:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:43,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:43,919 INFO L225 Difference]: With dead ends: 254 [2021-06-05 04:22:43,919 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 04:22:43,920 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 04:22:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 161. [2021-06-05 04:22:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 04:22:43,926 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 04:22:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:43,926 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 04:22:43,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 04:22:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:43,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:43,927 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:44,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:44,128 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash 4818636, now seen corresponding path program 11 times [2021-06-05 04:22:44,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:44,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723421010] [2021-06-05 04:22:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:44,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:44,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723421010] [2021-06-05 04:22:44,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723421010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:44,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845801744] [2021-06-05 04:22:44,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:44,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:44,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:44,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:44,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845801744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:44,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:44,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:22:44,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644916057] [2021-06-05 04:22:44,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:44,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:44,292 INFO L87 Difference]: Start difference. First operand 161 states and 480 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:44,420 INFO L93 Difference]: Finished difference Result 244 states and 694 transitions. [2021-06-05 04:22:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:44,422 INFO L225 Difference]: With dead ends: 244 [2021-06-05 04:22:44,422 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 04:22:44,422 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 123.4ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 04:22:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2021-06-05 04:22:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0123456790123457) internal successors, (488), 162 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 488 transitions. [2021-06-05 04:22:44,427 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 488 transitions. Word has length 15 [2021-06-05 04:22:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:44,427 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 488 transitions. [2021-06-05 04:22:44,427 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 488 transitions. [2021-06-05 04:22:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:44,428 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:44,428 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:44,649 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:44,649 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1366374742, now seen corresponding path program 12 times [2021-06-05 04:22:44,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:44,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471760017] [2021-06-05 04:22:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:44,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:44,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471760017] [2021-06-05 04:22:44,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471760017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:44,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387706245] [2021-06-05 04:22:44,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:44,728 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:44,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:44,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:44,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387706245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:44,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:44,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:22:44,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860218440] [2021-06-05 04:22:44,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:44,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:44,812 INFO L87 Difference]: Start difference. First operand 163 states and 488 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:44,946 INFO L93 Difference]: Finished difference Result 217 states and 622 transitions. [2021-06-05 04:22:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:44,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:44,947 INFO L225 Difference]: With dead ends: 217 [2021-06-05 04:22:44,947 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 04:22:44,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 106.6ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 04:22:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2021-06-05 04:22:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 04:22:44,953 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 04:22:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:44,953 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 04:22:44,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 04:22:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:44,953 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:44,954 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:45,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:45,165 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1908842768, now seen corresponding path program 3 times [2021-06-05 04:22:45,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:45,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587550008] [2021-06-05 04:22:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:45,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:45,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587550008] [2021-06-05 04:22:45,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587550008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:45,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586043256] [2021-06-05 04:22:45,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:45,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:45,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:45,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:45,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:45,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586043256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:45,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:45,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 04:22:45,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360321136] [2021-06-05 04:22:45,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:45,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:45,315 INFO L87 Difference]: Start difference. First operand 161 states and 480 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:45,599 INFO L93 Difference]: Finished difference Result 274 states and 770 transitions. [2021-06-05 04:22:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:22:45,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:45,601 INFO L225 Difference]: With dead ends: 274 [2021-06-05 04:22:45,601 INFO L226 Difference]: Without dead ends: 221 [2021-06-05 04:22:45,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 204.5ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:22:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-06-05 04:22:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158. [2021-06-05 04:22:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 04:22:45,608 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 04:22:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:45,608 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 04:22:45,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 04:22:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:45,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:45,609 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:45,824 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 04:22:45,825 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1057034826, now seen corresponding path program 13 times [2021-06-05 04:22:45,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:45,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410655314] [2021-06-05 04:22:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:45,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:45,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410655314] [2021-06-05 04:22:45,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410655314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:45,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506395257] [2021-06-05 04:22:45,894 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:45,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:45,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:46,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506395257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:46,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:46,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:46,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880287776] [2021-06-05 04:22:46,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:46,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:46,036 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:46,239 INFO L93 Difference]: Finished difference Result 270 states and 738 transitions. [2021-06-05 04:22:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:46,241 INFO L225 Difference]: With dead ends: 270 [2021-06-05 04:22:46,241 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 04:22:46,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 194.8ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 04:22:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2021-06-05 04:22:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0185185185185186) internal successors, (489), 162 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 489 transitions. [2021-06-05 04:22:46,247 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 489 transitions. Word has length 15 [2021-06-05 04:22:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:46,247 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 489 transitions. [2021-06-05 04:22:46,247 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 489 transitions. [2021-06-05 04:22:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:46,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:46,248 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:46,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 04:22:46,465 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash -475216596, now seen corresponding path program 14 times [2021-06-05 04:22:46,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:46,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774421511] [2021-06-05 04:22:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:46,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:46,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774421511] [2021-06-05 04:22:46,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774421511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:46,549 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874225704] [2021-06-05 04:22:46,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:46,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:46,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:46,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:46,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:46,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874225704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:46,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:46,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:46,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006860158] [2021-06-05 04:22:46,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:46,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:46,681 INFO L87 Difference]: Start difference. First operand 163 states and 489 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:46,929 INFO L93 Difference]: Finished difference Result 280 states and 770 transitions. [2021-06-05 04:22:46,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:46,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:46,931 INFO L225 Difference]: With dead ends: 280 [2021-06-05 04:22:46,931 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 04:22:46,931 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 257.9ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 04:22:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 158. [2021-06-05 04:22:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 04:22:46,936 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 04:22:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:46,937 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 04:22:46,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 04:22:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:46,937 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:46,937 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:47,161 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-06-05 04:22:47,161 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1798468500, now seen corresponding path program 15 times [2021-06-05 04:22:47,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:47,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520794240] [2021-06-05 04:22:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:47,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:47,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520794240] [2021-06-05 04:22:47,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520794240] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:47,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58727579] [2021-06-05 04:22:47,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:47,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:47,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:47,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:47,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:47,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58727579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:47,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:47,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:47,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703487133] [2021-06-05 04:22:47,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:47,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:47,342 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:47,604 INFO L93 Difference]: Finished difference Result 305 states and 819 transitions. [2021-06-05 04:22:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:47,606 INFO L225 Difference]: With dead ends: 305 [2021-06-05 04:22:47,606 INFO L226 Difference]: Without dead ends: 300 [2021-06-05 04:22:47,606 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 242.3ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-06-05 04:22:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 160. [2021-06-05 04:22:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.9748427672955975) internal successors, (473), 159 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 473 transitions. [2021-06-05 04:22:47,610 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 473 transitions. Word has length 15 [2021-06-05 04:22:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:47,611 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 473 transitions. [2021-06-05 04:22:47,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 473 transitions. [2021-06-05 04:22:47,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:47,611 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:47,611 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:47,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 04:22:47,833 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1744914988, now seen corresponding path program 16 times [2021-06-05 04:22:47,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:47,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984818817] [2021-06-05 04:22:47,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:47,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:47,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984818817] [2021-06-05 04:22:47,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984818817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:47,892 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808190174] [2021-06-05 04:22:47,892 INFO L93 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:47,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:47,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:47,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:47,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:48,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808190174] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:48,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:48,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:48,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899611119] [2021-06-05 04:22:48,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:48,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:48,025 INFO L87 Difference]: Start difference. First operand 160 states and 473 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:48,334 INFO L93 Difference]: Finished difference Result 284 states and 780 transitions. [2021-06-05 04:22:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:48,336 INFO L225 Difference]: With dead ends: 284 [2021-06-05 04:22:48,336 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 04:22:48,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 285.7ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:48,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 04:22:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 158. [2021-06-05 04:22:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 04:22:48,341 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 04:22:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:48,341 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 04:22:48,341 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,341 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 04:22:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:48,342 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:48,342 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:48,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:48,542 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1994299840, now seen corresponding path program 17 times [2021-06-05 04:22:48,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:48,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457847152] [2021-06-05 04:22:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:48,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:48,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457847152] [2021-06-05 04:22:48,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457847152] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:48,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557969998] [2021-06-05 04:22:48,612 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:48,649 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:48,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:48,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:48,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:48,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557969998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:48,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:48,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:48,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786227493] [2021-06-05 04:22:48,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:48,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:48,744 INFO L87 Difference]: Start difference. First operand 158 states and 469 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:48,987 INFO L93 Difference]: Finished difference Result 306 states and 841 transitions. [2021-06-05 04:22:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:48,988 INFO L225 Difference]: With dead ends: 306 [2021-06-05 04:22:48,988 INFO L226 Difference]: Without dead ends: 301 [2021-06-05 04:22:48,988 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 240.0ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-06-05 04:22:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 159. [2021-06-05 04:22:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.9873417721518987) internal successors, (472), 158 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 472 transitions. [2021-06-05 04:22:48,992 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 472 transitions. Word has length 15 [2021-06-05 04:22:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:48,992 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 472 transitions. [2021-06-05 04:22:48,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 472 transitions. [2021-06-05 04:22:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:48,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:48,993 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:49,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:49,205 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1620609086, now seen corresponding path program 4 times [2021-06-05 04:22:49,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:49,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104129825] [2021-06-05 04:22:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:49,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:49,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104129825] [2021-06-05 04:22:49,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104129825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:49,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341996241] [2021-06-05 04:22:49,248 INFO L93 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:49,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:49,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:49,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:49,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:49,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341996241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:49,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:49,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 04:22:49,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788714816] [2021-06-05 04:22:49,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:49,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:49,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:49,334 INFO L87 Difference]: Start difference. First operand 159 states and 472 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:49,554 INFO L93 Difference]: Finished difference Result 251 states and 682 transitions. [2021-06-05 04:22:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:22:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:49,555 INFO L225 Difference]: With dead ends: 251 [2021-06-05 04:22:49,555 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 04:22:49,555 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 04:22:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 155. [2021-06-05 04:22:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.9415584415584415) internal successors, (453), 154 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 453 transitions. [2021-06-05 04:22:49,559 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 453 transitions. Word has length 15 [2021-06-05 04:22:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:49,559 INFO L482 AbstractCegarLoop]: Abstraction has 155 states and 453 transitions. [2021-06-05 04:22:49,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 453 transitions. [2021-06-05 04:22:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:49,560 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:49,560 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:49,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:49,769 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -939111350, now seen corresponding path program 18 times [2021-06-05 04:22:49,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:49,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847612443] [2021-06-05 04:22:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:49,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:49,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847612443] [2021-06-05 04:22:49,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847612443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:49,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160162510] [2021-06-05 04:22:49,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:49,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:49,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:49,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:49,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:49,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160162510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:49,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:49,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:49,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143212226] [2021-06-05 04:22:49,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:49,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:49,971 INFO L87 Difference]: Start difference. First operand 155 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:50,249 INFO L93 Difference]: Finished difference Result 284 states and 778 transitions. [2021-06-05 04:22:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:50,251 INFO L225 Difference]: With dead ends: 284 [2021-06-05 04:22:50,251 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 04:22:50,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 250.8ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 04:22:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 151. [2021-06-05 04:22:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.9133333333333336) internal successors, (437), 150 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 437 transitions. [2021-06-05 04:22:50,255 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 437 transitions. Word has length 15 [2021-06-05 04:22:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:50,255 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 437 transitions. [2021-06-05 04:22:50,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 437 transitions. [2021-06-05 04:22:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:50,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:50,256 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:50,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 04:22:50,469 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash 738121340, now seen corresponding path program 5 times [2021-06-05 04:22:50,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:50,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777577872] [2021-06-05 04:22:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:50,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:50,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777577872] [2021-06-05 04:22:50,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777577872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:50,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329241161] [2021-06-05 04:22:50,502 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:50,545 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:50,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:50,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 04:22:50,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:50,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329241161] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:50,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:50,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:22:50,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047323271] [2021-06-05 04:22:50,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:22:50,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:22:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:22:50,599 INFO L87 Difference]: Start difference. First operand 151 states and 437 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:50,694 INFO L93 Difference]: Finished difference Result 221 states and 607 transitions. [2021-06-05 04:22:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:50,695 INFO L225 Difference]: With dead ends: 221 [2021-06-05 04:22:50,695 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 04:22:50,695 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 04:22:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 133. [2021-06-05 04:22:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9393939393939394) internal successors, (388), 132 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 388 transitions. [2021-06-05 04:22:50,699 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 388 transitions. Word has length 15 [2021-06-05 04:22:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:50,699 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 388 transitions. [2021-06-05 04:22:50,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 388 transitions. [2021-06-05 04:22:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:50,699 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:50,699 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:50,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 04:22:50,909 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash -338576526, now seen corresponding path program 6 times [2021-06-05 04:22:50,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:50,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138098018] [2021-06-05 04:22:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:50,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:50,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138098018] [2021-06-05 04:22:50,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138098018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:50,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991523901] [2021-06-05 04:22:50,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:51,003 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:51,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:51,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:51,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991523901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:51,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:51,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 04:22:51,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341634354] [2021-06-05 04:22:51,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:51,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:51,048 INFO L87 Difference]: Start difference. First operand 133 states and 388 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:51,273 INFO L93 Difference]: Finished difference Result 237 states and 658 transitions. [2021-06-05 04:22:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:22:51,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:51,274 INFO L225 Difference]: With dead ends: 237 [2021-06-05 04:22:51,274 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 04:22:51,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 160.1ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 04:22:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 135. [2021-06-05 04:22:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 04:22:51,279 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 04:22:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:51,279 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 04:22:51,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 04:22:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:51,280 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:51,280 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:51,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 04:22:51,501 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1210723178, now seen corresponding path program 19 times [2021-06-05 04:22:51,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:51,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561552358] [2021-06-05 04:22:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:51,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:51,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561552358] [2021-06-05 04:22:51,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561552358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:51,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610204039] [2021-06-05 04:22:51,567 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:51,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:51,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610204039] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:51,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:51,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:51,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175514371] [2021-06-05 04:22:51,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:51,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:51,686 INFO L87 Difference]: Start difference. First operand 135 states and 396 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:51,865 INFO L93 Difference]: Finished difference Result 203 states and 539 transitions. [2021-06-05 04:22:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:51,866 INFO L225 Difference]: With dead ends: 203 [2021-06-05 04:22:51,866 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 04:22:51,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 183.0ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 04:22:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 137. [2021-06-05 04:22:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.9411764705882355) internal successors, (400), 136 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 400 transitions. [2021-06-05 04:22:51,869 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 400 transitions. Word has length 15 [2021-06-05 04:22:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:51,869 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 400 transitions. [2021-06-05 04:22:51,869 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 400 transitions. [2021-06-05 04:22:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:51,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:51,870 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:52,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:52,073 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1962306986, now seen corresponding path program 20 times [2021-06-05 04:22:52,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:52,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010162768] [2021-06-05 04:22:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:52,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:52,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010162768] [2021-06-05 04:22:52,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010162768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:52,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801045495] [2021-06-05 04:22:52,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:52,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:52,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:52,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:52,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:52,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801045495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:52,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:52,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:52,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533540739] [2021-06-05 04:22:52,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:52,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:52,257 INFO L87 Difference]: Start difference. First operand 137 states and 400 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:52,470 INFO L93 Difference]: Finished difference Result 202 states and 540 transitions. [2021-06-05 04:22:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:52,471 INFO L225 Difference]: With dead ends: 202 [2021-06-05 04:22:52,472 INFO L226 Difference]: Without dead ends: 196 [2021-06-05 04:22:52,472 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 210.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:22:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-06-05 04:22:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2021-06-05 04:22:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 04:22:52,475 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 04:22:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:52,475 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 04:22:52,475 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 04:22:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:52,476 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:52,476 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:52,689 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 04:22:52,689 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1226951760, now seen corresponding path program 4 times [2021-06-05 04:22:52,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:52,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951149788] [2021-06-05 04:22:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:52,719 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:52,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951149788] [2021-06-05 04:22:52,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951149788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:52,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068417206] [2021-06-05 04:22:52,720 INFO L93 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:52,742 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:52,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:52,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 04:22:52,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:52,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068417206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:52,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:52,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:22:52,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760329342] [2021-06-05 04:22:52,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:52,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:52,804 INFO L87 Difference]: Start difference. First operand 135 states and 396 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:52,911 INFO L93 Difference]: Finished difference Result 205 states and 542 transitions. [2021-06-05 04:22:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:52,912 INFO L225 Difference]: With dead ends: 205 [2021-06-05 04:22:52,912 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 04:22:52,913 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:22:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 04:22:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2021-06-05 04:22:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9357142857142855) internal successors, (411), 140 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 411 transitions. [2021-06-05 04:22:52,917 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 411 transitions. Word has length 15 [2021-06-05 04:22:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:52,917 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 411 transitions. [2021-06-05 04:22:52,917 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 411 transitions. [2021-06-05 04:22:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:52,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:52,917 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:53,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:53,118 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash -886595830, now seen corresponding path program 21 times [2021-06-05 04:22:53,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:53,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763549627] [2021-06-05 04:22:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:53,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:53,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763549627] [2021-06-05 04:22:53,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763549627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:53,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597817202] [2021-06-05 04:22:53,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:53,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:53,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:53,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:53,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:53,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597817202] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:53,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:53,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:53,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308744831] [2021-06-05 04:22:53,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:53,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:53,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:53,261 INFO L87 Difference]: Start difference. First operand 141 states and 411 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:53,450 INFO L93 Difference]: Finished difference Result 181 states and 502 transitions. [2021-06-05 04:22:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:53,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:53,451 INFO L225 Difference]: With dead ends: 181 [2021-06-05 04:22:53,451 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 04:22:53,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 175.4ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 04:22:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2021-06-05 04:22:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 04:22:53,453 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 04:22:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:53,453 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 04:22:53,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 04:22:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:53,454 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:53,454 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:53,654 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2021-06-05 04:22:53,654 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1651983020, now seen corresponding path program 5 times [2021-06-05 04:22:53,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:53,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771933136] [2021-06-05 04:22:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:53,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:53,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771933136] [2021-06-05 04:22:53,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771933136] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:53,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920880647] [2021-06-05 04:22:53,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:53,733 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:53,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:53,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 04:22:53,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:53,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920880647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:53,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:53,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:22:53,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601112901] [2021-06-05 04:22:53,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:22:53,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:53,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:22:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:22:53,779 INFO L87 Difference]: Start difference. First operand 141 states and 410 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:53,878 INFO L93 Difference]: Finished difference Result 190 states and 512 transitions. [2021-06-05 04:22:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:53,879 INFO L225 Difference]: With dead ends: 190 [2021-06-05 04:22:53,879 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 04:22:53,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:22:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 04:22:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 04:22:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.948148148148148) internal successors, (398), 135 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 398 transitions. [2021-06-05 04:22:53,882 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 398 transitions. Word has length 15 [2021-06-05 04:22:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:53,882 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 398 transitions. [2021-06-05 04:22:53,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 398 transitions. [2021-06-05 04:22:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:53,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:53,883 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:54,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2021-06-05 04:22:54,084 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1441032960, now seen corresponding path program 6 times [2021-06-05 04:22:54,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:54,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404948467] [2021-06-05 04:22:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:54,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:54,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404948467] [2021-06-05 04:22:54,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404948467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:54,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076333953] [2021-06-05 04:22:54,121 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:54,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:54,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:54,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:54,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:54,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076333953] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:54,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:54,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:54,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988905063] [2021-06-05 04:22:54,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:54,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:54,214 INFO L87 Difference]: Start difference. First operand 136 states and 398 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:54,557 INFO L93 Difference]: Finished difference Result 214 states and 572 transitions. [2021-06-05 04:22:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:22:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:54,559 INFO L225 Difference]: With dead ends: 214 [2021-06-05 04:22:54,559 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 04:22:54,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 263.5ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:22:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 04:22:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2021-06-05 04:22:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.8970588235294117) internal successors, (394), 136 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 394 transitions. [2021-06-05 04:22:54,562 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 394 transitions. Word has length 15 [2021-06-05 04:22:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:54,562 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 394 transitions. [2021-06-05 04:22:54,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 394 transitions. [2021-06-05 04:22:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:54,562 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:54,562 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:54,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2021-06-05 04:22:54,777 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash 981607308, now seen corresponding path program 22 times [2021-06-05 04:22:54,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:54,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628472706] [2021-06-05 04:22:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:54,835 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:54,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628472706] [2021-06-05 04:22:54,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628472706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:54,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13123647] [2021-06-05 04:22:54,835 INFO L93 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:54,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:54,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:54,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:54,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:54,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13123647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:54,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:54,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:54,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129455042] [2021-06-05 04:22:54,952 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:54,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:54,953 INFO L87 Difference]: Start difference. First operand 137 states and 394 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:55,174 INFO L93 Difference]: Finished difference Result 214 states and 591 transitions. [2021-06-05 04:22:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:55,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:55,176 INFO L225 Difference]: With dead ends: 214 [2021-06-05 04:22:55,176 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 04:22:55,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 201.2ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 04:22:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2021-06-05 04:22:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 04:22:55,178 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 04:22:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:55,179 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 04:22:55,179 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 04:22:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:55,179 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:55,179 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:55,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 04:22:55,393 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1951803882, now seen corresponding path program 23 times [2021-06-05 04:22:55,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:55,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988977043] [2021-06-05 04:22:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:55,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:55,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988977043] [2021-06-05 04:22:55,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988977043] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:55,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136556064] [2021-06-05 04:22:55,448 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:55,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:55,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:55,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:55,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:55,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136556064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:55,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:55,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:22:55,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602910196] [2021-06-05 04:22:55,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:22:55,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:22:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:22:55,583 INFO L87 Difference]: Start difference. First operand 141 states and 410 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:55,801 INFO L93 Difference]: Finished difference Result 223 states and 605 transitions. [2021-06-05 04:22:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:55,802 INFO L225 Difference]: With dead ends: 223 [2021-06-05 04:22:55,803 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 04:22:55,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 200.4ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 04:22:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 140. [2021-06-05 04:22:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.9280575539568345) internal successors, (407), 139 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 407 transitions. [2021-06-05 04:22:55,806 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 407 transitions. Word has length 15 [2021-06-05 04:22:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:55,806 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 407 transitions. [2021-06-05 04:22:55,807 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 407 transitions. [2021-06-05 04:22:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:55,807 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:55,807 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:56,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:56,017 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:56,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1273184878, now seen corresponding path program 7 times [2021-06-05 04:22:56,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:56,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739537188] [2021-06-05 04:22:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:56,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:56,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739537188] [2021-06-05 04:22:56,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739537188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:56,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425807850] [2021-06-05 04:22:56,050 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:56,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:56,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:56,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425807850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:56,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:56,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:56,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470186462] [2021-06-05 04:22:56,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:56,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:56,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:56,144 INFO L87 Difference]: Start difference. First operand 140 states and 407 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:56,437 INFO L93 Difference]: Finished difference Result 227 states and 607 transitions. [2021-06-05 04:22:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:22:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:56,438 INFO L225 Difference]: With dead ends: 227 [2021-06-05 04:22:56,438 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 04:22:56,438 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 204.9ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:22:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 04:22:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 04:22:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 04:22:56,441 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 15 [2021-06-05 04:22:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:56,441 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 04:22:56,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 04:22:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:56,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:56,441 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:56,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2021-06-05 04:22:56,645 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1807933612, now seen corresponding path program 24 times [2021-06-05 04:22:56,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:56,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953543871] [2021-06-05 04:22:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:56,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:56,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953543871] [2021-06-05 04:22:56,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953543871] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:56,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143307869] [2021-06-05 04:22:56,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:56,731 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:22:56,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:56,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:56,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:56,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143307869] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:56,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:56,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:56,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651870545] [2021-06-05 04:22:56,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:56,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:56,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:56,808 INFO L87 Difference]: Start difference. First operand 135 states and 386 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:56,963 INFO L93 Difference]: Finished difference Result 190 states and 521 transitions. [2021-06-05 04:22:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:56,964 INFO L225 Difference]: With dead ends: 190 [2021-06-05 04:22:56,964 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 04:22:56,964 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 160.9ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:22:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 04:22:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 04:22:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8666666666666667) internal successors, (387), 135 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 387 transitions. [2021-06-05 04:22:56,988 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 387 transitions. Word has length 15 [2021-06-05 04:22:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:56,990 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 387 transitions. [2021-06-05 04:22:56,990 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 387 transitions. [2021-06-05 04:22:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:56,991 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:56,991 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:57,208 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:57,209 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1042546422, now seen corresponding path program 8 times [2021-06-05 04:22:57,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:57,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395111455] [2021-06-05 04:22:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:57,238 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:57,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395111455] [2021-06-05 04:22:57,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395111455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:57,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800127377] [2021-06-05 04:22:57,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:57,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:57,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:57,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:22:57,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:57,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800127377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:57,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:57,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 04:22:57,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415358704] [2021-06-05 04:22:57,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:22:57,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:22:57,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:22:57,314 INFO L87 Difference]: Start difference. First operand 136 states and 387 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:57,667 INFO L93 Difference]: Finished difference Result 269 states and 705 transitions. [2021-06-05 04:22:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:22:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:57,668 INFO L225 Difference]: With dead ends: 269 [2021-06-05 04:22:57,668 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 04:22:57,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 245.4ms TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:22:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 04:22:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 111. [2021-06-05 04:22:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.8727272727272726) internal successors, (316), 110 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 316 transitions. [2021-06-05 04:22:57,671 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 316 transitions. Word has length 15 [2021-06-05 04:22:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:57,671 INFO L482 AbstractCegarLoop]: Abstraction has 111 states and 316 transitions. [2021-06-05 04:22:57,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 316 transitions. [2021-06-05 04:22:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:57,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:57,672 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:57,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2021-06-05 04:22:57,872 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1544487814, now seen corresponding path program 25 times [2021-06-05 04:22:57,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:57,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446159451] [2021-06-05 04:22:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:57,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:57,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446159451] [2021-06-05 04:22:57,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446159451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:57,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195867934] [2021-06-05 04:22:57,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:57,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:57,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:58,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195867934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:58,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:58,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:58,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126623919] [2021-06-05 04:22:58,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:58,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:58,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:58,034 INFO L87 Difference]: Start difference. First operand 111 states and 316 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:58,177 INFO L93 Difference]: Finished difference Result 195 states and 547 transitions. [2021-06-05 04:22:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:58,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:58,179 INFO L225 Difference]: With dead ends: 195 [2021-06-05 04:22:58,179 INFO L226 Difference]: Without dead ends: 190 [2021-06-05 04:22:58,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 123.1ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-06-05 04:22:58,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 115. [2021-06-05 04:22:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8771929824561404) internal successors, (328), 114 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 328 transitions. [2021-06-05 04:22:58,181 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 328 transitions. Word has length 15 [2021-06-05 04:22:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:58,181 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 328 transitions. [2021-06-05 04:22:58,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 328 transitions. [2021-06-05 04:22:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:58,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:58,181 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:58,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:58,382 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:58,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1323878784, now seen corresponding path program 26 times [2021-06-05 04:22:58,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:58,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944958832] [2021-06-05 04:22:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:58,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:58,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944958832] [2021-06-05 04:22:58,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944958832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:58,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422421562] [2021-06-05 04:22:58,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:58,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:22:58,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:58,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:58,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:58,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422421562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:58,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:58,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:58,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969846228] [2021-06-05 04:22:58,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:58,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:58,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:58,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:58,551 INFO L87 Difference]: Start difference. First operand 115 states and 328 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:58,782 INFO L93 Difference]: Finished difference Result 234 states and 644 transitions. [2021-06-05 04:22:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:58,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:58,784 INFO L225 Difference]: With dead ends: 234 [2021-06-05 04:22:58,784 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 04:22:58,784 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 193.1ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 04:22:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 117. [2021-06-05 04:22:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.896551724137931) internal successors, (336), 116 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 336 transitions. [2021-06-05 04:22:58,786 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 336 transitions. Word has length 15 [2021-06-05 04:22:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:58,786 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 336 transitions. [2021-06-05 04:22:58,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 336 transitions. [2021-06-05 04:22:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:58,787 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:58,787 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:58,987 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:58,987 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 37677322, now seen corresponding path program 27 times [2021-06-05 04:22:58,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:58,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453258508] [2021-06-05 04:22:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:59,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:59,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453258508] [2021-06-05 04:22:59,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453258508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:59,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042879828] [2021-06-05 04:22:59,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:59,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:22:59,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:59,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:59,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:59,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042879828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:59,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:59,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:59,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003426843] [2021-06-05 04:22:59,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:59,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:59,179 INFO L87 Difference]: Start difference. First operand 117 states and 336 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:59,407 INFO L93 Difference]: Finished difference Result 207 states and 572 transitions. [2021-06-05 04:22:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:59,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:59,408 INFO L225 Difference]: With dead ends: 207 [2021-06-05 04:22:59,408 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 04:22:59,409 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 227.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:22:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 04:22:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2021-06-05 04:22:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 04:22:59,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 04:22:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:59,411 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 04:22:59,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 04:22:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:59,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:59,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:22:59,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2021-06-05 04:22:59,625 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:22:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:22:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1830225050, now seen corresponding path program 28 times [2021-06-05 04:22:59,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:22:59,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433030959] [2021-06-05 04:22:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:22:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:22:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:59,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:22:59,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433030959] [2021-06-05 04:22:59,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433030959] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:59,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502859748] [2021-06-05 04:22:59,677 INFO L93 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:22:59,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:22:59,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:22:59,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:22:59,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:22:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:22:59,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502859748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:22:59,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:22:59,791 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:22:59,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24830036] [2021-06-05 04:22:59,791 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:22:59,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:22:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:22:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:22:59,792 INFO L87 Difference]: Start difference. First operand 113 states and 322 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:22:59,992 INFO L93 Difference]: Finished difference Result 185 states and 511 transitions. [2021-06-05 04:22:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:22:59,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:22:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:22:59,993 INFO L225 Difference]: With dead ends: 185 [2021-06-05 04:22:59,993 INFO L226 Difference]: Without dead ends: 180 [2021-06-05 04:22:59,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 165.1ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:22:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-06-05 04:22:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 117. [2021-06-05 04:22:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.913793103448276) internal successors, (338), 116 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 338 transitions. [2021-06-05 04:22:59,996 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 338 transitions. Word has length 15 [2021-06-05 04:22:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:22:59,996 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 338 transitions. [2021-06-05 04:22:59,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:22:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 338 transitions. [2021-06-05 04:22:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:22:59,996 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:22:59,996 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:00,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:00,205 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash -468668944, now seen corresponding path program 29 times [2021-06-05 04:23:00,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:00,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994803730] [2021-06-05 04:23:00,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:00,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:00,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994803730] [2021-06-05 04:23:00,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994803730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:00,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622460210] [2021-06-05 04:23:00,257 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:00,303 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:00,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:00,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:23:00,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:00,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622460210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:00,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:00,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:00,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205034861] [2021-06-05 04:23:00,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:00,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:00,376 INFO L87 Difference]: Start difference. First operand 117 states and 338 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:00,582 INFO L93 Difference]: Finished difference Result 195 states and 528 transitions. [2021-06-05 04:23:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:23:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:00,583 INFO L225 Difference]: With dead ends: 195 [2021-06-05 04:23:00,583 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 04:23:00,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 184.6ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 04:23:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2021-06-05 04:23:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8947368421052633) internal successors, (330), 114 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 330 transitions. [2021-06-05 04:23:00,587 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 330 transitions. Word has length 15 [2021-06-05 04:23:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:00,587 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 330 transitions. [2021-06-05 04:23:00,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 330 transitions. [2021-06-05 04:23:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 04:23:00,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:00,588 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:00,809 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2021-06-05 04:23:00,809 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1003898746, now seen corresponding path program 30 times [2021-06-05 04:23:00,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:00,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579160306] [2021-06-05 04:23:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:00,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:00,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579160306] [2021-06-05 04:23:00,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579160306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:00,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198712585] [2021-06-05 04:23:00,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:00,877 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:00,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:00,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 04:23:00,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:00,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198712585] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:00,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:00,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:00,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291995692] [2021-06-05 04:23:00,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:00,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:00,946 INFO L87 Difference]: Start difference. First operand 115 states and 330 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:01,124 INFO L93 Difference]: Finished difference Result 166 states and 460 transitions. [2021-06-05 04:23:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 04:23:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:01,125 INFO L225 Difference]: With dead ends: 166 [2021-06-05 04:23:01,125 INFO L226 Difference]: Without dead ends: 159 [2021-06-05 04:23:01,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 134.3ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-06-05 04:23:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2021-06-05 04:23:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 04:23:01,128 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 04:23:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:01,128 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 04:23:01,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 04:23:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:01,128 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:01,128 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:01,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable182 [2021-06-05 04:23:01,341 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:01,341 INFO L82 PathProgramCache]: Analyzing trace with hash -639898996, now seen corresponding path program 1 times [2021-06-05 04:23:01,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:01,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471313259] [2021-06-05 04:23:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:01,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:01,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471313259] [2021-06-05 04:23:01,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471313259] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:01,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487503439] [2021-06-05 04:23:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:01,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:01,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:01,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487503439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:01,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:01,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:01,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418546995] [2021-06-05 04:23:01,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:01,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:01,447 INFO L87 Difference]: Start difference. First operand 113 states and 322 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:01,540 INFO L93 Difference]: Finished difference Result 186 states and 521 transitions. [2021-06-05 04:23:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:01,541 INFO L225 Difference]: With dead ends: 186 [2021-06-05 04:23:01,542 INFO L226 Difference]: Without dead ends: 186 [2021-06-05 04:23:01,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-06-05 04:23:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 126. [2021-06-05 04:23:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.992) internal successors, (374), 125 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 374 transitions. [2021-06-05 04:23:01,544 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 374 transitions. Word has length 16 [2021-06-05 04:23:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:01,544 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 374 transitions. [2021-06-05 04:23:01,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 374 transitions. [2021-06-05 04:23:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:01,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:01,545 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:01,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:01,745 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1991072770, now seen corresponding path program 1 times [2021-06-05 04:23:01,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:01,746 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612320415] [2021-06-05 04:23:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:01,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612320415] [2021-06-05 04:23:01,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612320415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:01,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878782449] [2021-06-05 04:23:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:01,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:01,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:01,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878782449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:01,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:01,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:01,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189684961] [2021-06-05 04:23:01,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:01,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:01,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:01,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:01,833 INFO L87 Difference]: Start difference. First operand 126 states and 374 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:01,912 INFO L93 Difference]: Finished difference Result 163 states and 462 transitions. [2021-06-05 04:23:01,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:01,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:01,913 INFO L225 Difference]: With dead ends: 163 [2021-06-05 04:23:01,913 INFO L226 Difference]: Without dead ends: 153 [2021-06-05 04:23:01,913 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-06-05 04:23:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 126. [2021-06-05 04:23:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.952) internal successors, (369), 125 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 369 transitions. [2021-06-05 04:23:01,915 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 369 transitions. Word has length 16 [2021-06-05 04:23:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:01,915 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 369 transitions. [2021-06-05 04:23:01,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 369 transitions. [2021-06-05 04:23:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:01,915 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:01,915 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:02,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable188 [2021-06-05 04:23:02,116 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1652532542, now seen corresponding path program 2 times [2021-06-05 04:23:02,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:02,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524729276] [2021-06-05 04:23:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:02,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:02,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524729276] [2021-06-05 04:23:02,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524729276] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:02,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713114807] [2021-06-05 04:23:02,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:02,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:02,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:02,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:02,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:02,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713114807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:02,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:02,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:02,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626049774] [2021-06-05 04:23:02,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:02,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:02,234 INFO L87 Difference]: Start difference. First operand 126 states and 369 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:02,339 INFO L93 Difference]: Finished difference Result 193 states and 538 transitions. [2021-06-05 04:23:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:02,340 INFO L225 Difference]: With dead ends: 193 [2021-06-05 04:23:02,340 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 04:23:02,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 04:23:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 129. [2021-06-05 04:23:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 384 transitions. [2021-06-05 04:23:02,343 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 384 transitions. Word has length 16 [2021-06-05 04:23:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:02,343 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 384 transitions. [2021-06-05 04:23:02,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 384 transitions. [2021-06-05 04:23:02,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:02,344 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:02,344 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:02,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:02,549 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1447398580, now seen corresponding path program 2 times [2021-06-05 04:23:02,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:02,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131361708] [2021-06-05 04:23:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:02,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:02,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131361708] [2021-06-05 04:23:02,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131361708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:02,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141033132] [2021-06-05 04:23:02,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:02,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:02,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:02,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:02,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:02,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141033132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:02,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:02,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:02,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617577374] [2021-06-05 04:23:02,679 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:02,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:02,684 INFO L87 Difference]: Start difference. First operand 129 states and 384 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:02,763 INFO L93 Difference]: Finished difference Result 180 states and 505 transitions. [2021-06-05 04:23:02,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:02,764 INFO L225 Difference]: With dead ends: 180 [2021-06-05 04:23:02,765 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 04:23:02,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 96.3ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 04:23:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2021-06-05 04:23:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9925925925925925) internal successors, (404), 135 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 404 transitions. [2021-06-05 04:23:02,767 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 404 transitions. Word has length 16 [2021-06-05 04:23:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:02,767 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 404 transitions. [2021-06-05 04:23:02,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 404 transitions. [2021-06-05 04:23:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:02,767 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:02,767 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:02,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:02,968 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash -18443474, now seen corresponding path program 3 times [2021-06-05 04:23:02,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:02,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371272814] [2021-06-05 04:23:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:03,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371272814] [2021-06-05 04:23:03,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371272814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795170328] [2021-06-05 04:23:03,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:03,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:03,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:03,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:03,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795170328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:03,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:03,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448064192] [2021-06-05 04:23:03,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:03,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:03,098 INFO L87 Difference]: Start difference. First operand 136 states and 404 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:03,185 INFO L93 Difference]: Finished difference Result 176 states and 499 transitions. [2021-06-05 04:23:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:03,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:03,187 INFO L225 Difference]: With dead ends: 176 [2021-06-05 04:23:03,187 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 04:23:03,187 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 04:23:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2021-06-05 04:23:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9703703703703703) internal successors, (401), 135 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 401 transitions. [2021-06-05 04:23:03,189 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 401 transitions. Word has length 16 [2021-06-05 04:23:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:03,189 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 401 transitions. [2021-06-05 04:23:03,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 401 transitions. [2021-06-05 04:23:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:03,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:03,190 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:03,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:03,397 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 907579970, now seen corresponding path program 3 times [2021-06-05 04:23:03,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:03,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116822642] [2021-06-05 04:23:03,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:03,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116822642] [2021-06-05 04:23:03,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116822642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504189998] [2021-06-05 04:23:03,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:03,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:03,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:03,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:03,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504189998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:03,528 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:03,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833016175] [2021-06-05 04:23:03,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:03,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:03,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:03,528 INFO L87 Difference]: Start difference. First operand 136 states and 401 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:03,637 INFO L93 Difference]: Finished difference Result 162 states and 468 transitions. [2021-06-05 04:23:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:03,638 INFO L225 Difference]: With dead ends: 162 [2021-06-05 04:23:03,638 INFO L226 Difference]: Without dead ends: 162 [2021-06-05 04:23:03,638 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-06-05 04:23:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2021-06-05 04:23:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.9770992366412212) internal successors, (390), 131 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 390 transitions. [2021-06-05 04:23:03,641 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 390 transitions. Word has length 16 [2021-06-05 04:23:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:03,641 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 390 transitions. [2021-06-05 04:23:03,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 390 transitions. [2021-06-05 04:23:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:03,641 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:03,641 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:03,842 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:03,842 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:03,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash -408327260, now seen corresponding path program 4 times [2021-06-05 04:23:03,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:03,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835732606] [2021-06-05 04:23:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:03,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835732606] [2021-06-05 04:23:03,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835732606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992199663] [2021-06-05 04:23:03,879 INFO L93 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:03,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:03,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:03,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:03,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:03,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992199663] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:03,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:03,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:03,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731620315] [2021-06-05 04:23:03,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:03,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:03,965 INFO L87 Difference]: Start difference. First operand 132 states and 390 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:04,057 INFO L93 Difference]: Finished difference Result 192 states and 545 transitions. [2021-06-05 04:23:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:04,058 INFO L225 Difference]: With dead ends: 192 [2021-06-05 04:23:04,058 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 04:23:04,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 04:23:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2021-06-05 04:23:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0437956204379564) internal successors, (417), 137 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 417 transitions. [2021-06-05 04:23:04,060 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 417 transitions. Word has length 16 [2021-06-05 04:23:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:04,060 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 417 transitions. [2021-06-05 04:23:04,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 417 transitions. [2021-06-05 04:23:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:04,060 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:04,061 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:04,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 04:23:04,262 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 786708914, now seen corresponding path program 4 times [2021-06-05 04:23:04,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:04,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978242445] [2021-06-05 04:23:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:04,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:04,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978242445] [2021-06-05 04:23:04,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978242445] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:04,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895557159] [2021-06-05 04:23:04,288 INFO L93 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:04,311 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:04,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:04,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:04,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:04,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895557159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:04,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:04,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:04,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314861913] [2021-06-05 04:23:04,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:04,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:04,354 INFO L87 Difference]: Start difference. First operand 138 states and 417 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:04,455 INFO L93 Difference]: Finished difference Result 198 states and 562 transitions. [2021-06-05 04:23:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:04,456 INFO L225 Difference]: With dead ends: 198 [2021-06-05 04:23:04,456 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 04:23:04,456 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 04:23:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2021-06-05 04:23:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.054421768707483) internal successors, (449), 147 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 449 transitions. [2021-06-05 04:23:04,458 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 449 transitions. Word has length 16 [2021-06-05 04:23:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:04,458 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 449 transitions. [2021-06-05 04:23:04,458 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 449 transitions. [2021-06-05 04:23:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:04,459 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:04,459 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:04,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2021-06-05 04:23:04,659 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2079303276, now seen corresponding path program 5 times [2021-06-05 04:23:04,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:04,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397867752] [2021-06-05 04:23:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:04,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:04,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397867752] [2021-06-05 04:23:04,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397867752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:04,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713196189] [2021-06-05 04:23:04,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:04,725 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:04,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:04,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:04,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:04,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713196189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:04,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:04,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:04,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776884424] [2021-06-05 04:23:04,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:04,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:04,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:04,783 INFO L87 Difference]: Start difference. First operand 148 states and 449 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:04,870 INFO L93 Difference]: Finished difference Result 201 states and 572 transitions. [2021-06-05 04:23:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:04,871 INFO L225 Difference]: With dead ends: 201 [2021-06-05 04:23:04,871 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 04:23:04,871 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 76.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 04:23:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 148. [2021-06-05 04:23:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0340136054421767) internal successors, (446), 147 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 446 transitions. [2021-06-05 04:23:04,874 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 446 transitions. Word has length 16 [2021-06-05 04:23:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:04,874 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 446 transitions. [2021-06-05 04:23:04,874 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 446 transitions. [2021-06-05 04:23:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:04,874 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:04,874 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:05,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2021-06-05 04:23:05,085 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1153279832, now seen corresponding path program 5 times [2021-06-05 04:23:05,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:05,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023609395] [2021-06-05 04:23:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:05,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:05,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023609395] [2021-06-05 04:23:05,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023609395] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:05,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085102985] [2021-06-05 04:23:05,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:05,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:05,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:05,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:05,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:05,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085102985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:05,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:05,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:05,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583787208] [2021-06-05 04:23:05,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:05,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:05,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:05,190 INFO L87 Difference]: Start difference. First operand 148 states and 446 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:05,285 INFO L93 Difference]: Finished difference Result 200 states and 570 transitions. [2021-06-05 04:23:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:05,286 INFO L225 Difference]: With dead ends: 200 [2021-06-05 04:23:05,286 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 04:23:05,286 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.2ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 04:23:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2021-06-05 04:23:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0347222222222223) internal successors, (437), 144 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 437 transitions. [2021-06-05 04:23:05,290 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 437 transitions. Word has length 16 [2021-06-05 04:23:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:05,290 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 437 transitions. [2021-06-05 04:23:05,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 437 transitions. [2021-06-05 04:23:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:05,291 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:05,291 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:05,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2021-06-05 04:23:05,497 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1341923340, now seen corresponding path program 6 times [2021-06-05 04:23:05,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:05,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771371662] [2021-06-05 04:23:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:05,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:05,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771371662] [2021-06-05 04:23:05,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771371662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:05,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49159919] [2021-06-05 04:23:05,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:05,550 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:05,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:05,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:05,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:05,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49159919] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:05,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:05,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:05,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108350647] [2021-06-05 04:23:05,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:05,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:05,611 INFO L87 Difference]: Start difference. First operand 145 states and 437 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:05,690 INFO L93 Difference]: Finished difference Result 178 states and 518 transitions. [2021-06-05 04:23:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:05,691 INFO L225 Difference]: With dead ends: 178 [2021-06-05 04:23:05,691 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 04:23:05,691 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 04:23:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2021-06-05 04:23:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.013888888888889) internal successors, (434), 144 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 434 transitions. [2021-06-05 04:23:05,693 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 434 transitions. Word has length 16 [2021-06-05 04:23:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:05,693 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 434 transitions. [2021-06-05 04:23:05,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 434 transitions. [2021-06-05 04:23:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:05,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:05,694 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:05,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:05,897 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1171713858, now seen corresponding path program 6 times [2021-06-05 04:23:05,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:05,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99927994] [2021-06-05 04:23:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:05,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:05,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99927994] [2021-06-05 04:23:05,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99927994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:05,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67705005] [2021-06-05 04:23:05,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:05,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:05,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:05,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:05,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:06,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67705005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:06,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:06,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:06,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951673342] [2021-06-05 04:23:06,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:06,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:06,008 INFO L87 Difference]: Start difference. First operand 145 states and 434 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:06,088 INFO L93 Difference]: Finished difference Result 200 states and 574 transitions. [2021-06-05 04:23:06,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:06,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:06,089 INFO L225 Difference]: With dead ends: 200 [2021-06-05 04:23:06,089 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 04:23:06,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 04:23:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 138. [2021-06-05 04:23:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0) internal successors, (411), 137 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 411 transitions. [2021-06-05 04:23:06,096 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 411 transitions. Word has length 16 [2021-06-05 04:23:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:06,096 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 411 transitions. [2021-06-05 04:23:06,096 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 411 transitions. [2021-06-05 04:23:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:06,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:06,096 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:06,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2021-06-05 04:23:06,310 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 228804358, now seen corresponding path program 7 times [2021-06-05 04:23:06,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:06,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740065522] [2021-06-05 04:23:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:06,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:06,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740065522] [2021-06-05 04:23:06,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740065522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:06,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502570707] [2021-06-05 04:23:06,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:06,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:06,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:06,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502570707] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:06,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:06,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:06,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2320791] [2021-06-05 04:23:06,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:06,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:06,398 INFO L87 Difference]: Start difference. First operand 138 states and 411 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:06,473 INFO L93 Difference]: Finished difference Result 314 states and 911 transitions. [2021-06-05 04:23:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:06,475 INFO L225 Difference]: With dead ends: 314 [2021-06-05 04:23:06,475 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 04:23:06,475 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 50.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 04:23:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 152. [2021-06-05 04:23:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 04:23:06,478 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 04:23:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:06,478 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 04:23:06,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 04:23:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:06,479 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:06,479 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:06,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:06,696 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1435191172, now seen corresponding path program 7 times [2021-06-05 04:23:06,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:06,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687590137] [2021-06-05 04:23:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:06,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:06,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687590137] [2021-06-05 04:23:06,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687590137] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:06,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600594059] [2021-06-05 04:23:06,724 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:06,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:06,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:06,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600594059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:06,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:06,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:06,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374362307] [2021-06-05 04:23:06,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:06,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:06,804 INFO L87 Difference]: Start difference. First operand 152 states and 467 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:06,873 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 04:23:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:06,874 INFO L225 Difference]: With dead ends: 257 [2021-06-05 04:23:06,874 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 04:23:06,874 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 04:23:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2021-06-05 04:23:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 04:23:06,880 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 04:23:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:06,881 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 04:23:06,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 04:23:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:06,881 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:06,881 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:07,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2021-06-05 04:23:07,097 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:07,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1773731400, now seen corresponding path program 8 times [2021-06-05 04:23:07,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:07,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720418833] [2021-06-05 04:23:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,127 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:07,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720418833] [2021-06-05 04:23:07,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720418833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544242752] [2021-06-05 04:23:07,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:07,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:07,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:07,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:07,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544242752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:07,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:07,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635249900] [2021-06-05 04:23:07,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:07,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:07,191 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:07,276 INFO L93 Difference]: Finished difference Result 311 states and 888 transitions. [2021-06-05 04:23:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:07,278 INFO L225 Difference]: With dead ends: 311 [2021-06-05 04:23:07,278 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 04:23:07,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 04:23:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 158. [2021-06-05 04:23:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.1337579617834397) internal successors, (492), 157 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 492 transitions. [2021-06-05 04:23:07,281 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 492 transitions. Word has length 16 [2021-06-05 04:23:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:07,281 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 492 transitions. [2021-06-05 04:23:07,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 492 transitions. [2021-06-05 04:23:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:07,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:07,281 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:07,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:07,482 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash -578695226, now seen corresponding path program 8 times [2021-06-05 04:23:07,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:07,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084096513] [2021-06-05 04:23:07,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:07,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084096513] [2021-06-05 04:23:07,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084096513] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377657735] [2021-06-05 04:23:07,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:07,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:07,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:07,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:07,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377657735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:07,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:07,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730953610] [2021-06-05 04:23:07,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:07,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:07,591 INFO L87 Difference]: Start difference. First operand 158 states and 492 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:07,662 INFO L93 Difference]: Finished difference Result 283 states and 806 transitions. [2021-06-05 04:23:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:07,663 INFO L225 Difference]: With dead ends: 283 [2021-06-05 04:23:07,663 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 04:23:07,663 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 04:23:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 165. [2021-06-05 04:23:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1219512195121952) internal successors, (512), 164 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 512 transitions. [2021-06-05 04:23:07,667 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 512 transitions. Word has length 16 [2021-06-05 04:23:07,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:07,667 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 512 transitions. [2021-06-05 04:23:07,667 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 512 transitions. [2021-06-05 04:23:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:07,668 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:07,668 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:07,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2021-06-05 04:23:07,890 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:07,890 INFO L82 PathProgramCache]: Analyzing trace with hash 850259880, now seen corresponding path program 9 times [2021-06-05 04:23:07,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:07,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350477135] [2021-06-05 04:23:07,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:07,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350477135] [2021-06-05 04:23:07,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350477135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165932835] [2021-06-05 04:23:07,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:07,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:07,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:07,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:07,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:07,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165932835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:07,983 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:07,983 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:07,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866526605] [2021-06-05 04:23:07,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:07,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:07,984 INFO L87 Difference]: Start difference. First operand 165 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:08,062 INFO L93 Difference]: Finished difference Result 294 states and 846 transitions. [2021-06-05 04:23:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:08,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:08,063 INFO L225 Difference]: With dead ends: 294 [2021-06-05 04:23:08,063 INFO L226 Difference]: Without dead ends: 291 [2021-06-05 04:23:08,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-06-05 04:23:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 168. [2021-06-05 04:23:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0838323353293413) internal successors, (515), 167 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 515 transitions. [2021-06-05 04:23:08,066 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 515 transitions. Word has length 16 [2021-06-05 04:23:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:08,066 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 515 transitions. [2021-06-05 04:23:08,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 515 transitions. [2021-06-05 04:23:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:08,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:08,067 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:08,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:08,288 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1776283324, now seen corresponding path program 9 times [2021-06-05 04:23:08,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:08,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409620580] [2021-06-05 04:23:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:08,323 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:08,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409620580] [2021-06-05 04:23:08,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409620580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:08,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095028115] [2021-06-05 04:23:08,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:08,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:08,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:08,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:08,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:08,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095028115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:08,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:08,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:08,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333550118] [2021-06-05 04:23:08,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:08,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:08,434 INFO L87 Difference]: Start difference. First operand 168 states and 515 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:08,543 INFO L93 Difference]: Finished difference Result 271 states and 781 transitions. [2021-06-05 04:23:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:08,544 INFO L225 Difference]: With dead ends: 271 [2021-06-05 04:23:08,545 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 04:23:08,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 04:23:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 04:23:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 04:23:08,548 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 04:23:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:08,548 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 04:23:08,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 04:23:08,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:08,549 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:08,549 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:08,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2021-06-05 04:23:08,765 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2036008658, now seen corresponding path program 10 times [2021-06-05 04:23:08,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:08,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761127054] [2021-06-05 04:23:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:23:08,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:08,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761127054] [2021-06-05 04:23:08,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761127054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:08,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615388818] [2021-06-05 04:23:08,810 INFO L93 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:08,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:08,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:08,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:08,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615388818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:08,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:08,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:23:08,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284869270] [2021-06-05 04:23:08,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:08,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:08,892 INFO L87 Difference]: Start difference. First operand 153 states and 468 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:09,207 INFO L93 Difference]: Finished difference Result 308 states and 874 transitions. [2021-06-05 04:23:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:23:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:09,208 INFO L225 Difference]: With dead ends: 308 [2021-06-05 04:23:09,208 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 04:23:09,208 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 261.5ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:23:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 04:23:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 143. [2021-06-05 04:23:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.035211267605634) internal successors, (431), 142 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 431 transitions. [2021-06-05 04:23:09,211 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 431 transitions. Word has length 16 [2021-06-05 04:23:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:09,211 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 431 transitions. [2021-06-05 04:23:09,211 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 431 transitions. [2021-06-05 04:23:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:09,212 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:09,212 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:09,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:09,417 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1350168710, now seen corresponding path program 10 times [2021-06-05 04:23:09,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:09,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906628178] [2021-06-05 04:23:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:09,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:09,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906628178] [2021-06-05 04:23:09,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906628178] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:09,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:09,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:09,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550199441] [2021-06-05 04:23:09,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:09,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:09,450 INFO L87 Difference]: Start difference. First operand 143 states and 431 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:09,538 INFO L93 Difference]: Finished difference Result 204 states and 571 transitions. [2021-06-05 04:23:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:09,539 INFO L225 Difference]: With dead ends: 204 [2021-06-05 04:23:09,540 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 04:23:09,540 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 04:23:09,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2021-06-05 04:23:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0069444444444446) internal successors, (433), 144 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 433 transitions. [2021-06-05 04:23:09,542 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 433 transitions. Word has length 16 [2021-06-05 04:23:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:09,542 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 433 transitions. [2021-06-05 04:23:09,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 433 transitions. [2021-06-05 04:23:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:09,542 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:09,542 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:09,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-06-05 04:23:09,542 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -474092858, now seen corresponding path program 11 times [2021-06-05 04:23:09,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:09,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724519834] [2021-06-05 04:23:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:09,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:09,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724519834] [2021-06-05 04:23:09,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724519834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:09,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:09,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:09,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456381942] [2021-06-05 04:23:09,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:09,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:09,570 INFO L87 Difference]: Start difference. First operand 145 states and 433 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:09,669 INFO L93 Difference]: Finished difference Result 197 states and 551 transitions. [2021-06-05 04:23:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:09,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:09,674 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:09,674 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 04:23:09,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 04:23:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2021-06-05 04:23:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.966666666666667) internal successors, (445), 150 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 445 transitions. [2021-06-05 04:23:09,677 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 445 transitions. Word has length 16 [2021-06-05 04:23:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:09,677 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 445 transitions. [2021-06-05 04:23:09,677 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 445 transitions. [2021-06-05 04:23:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:09,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:09,677 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:09,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-06-05 04:23:09,677 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash -547465338, now seen corresponding path program 12 times [2021-06-05 04:23:09,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:09,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796249746] [2021-06-05 04:23:09,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:09,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:09,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796249746] [2021-06-05 04:23:09,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796249746] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:09,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:09,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:09,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153747754] [2021-06-05 04:23:09,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:09,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:09,708 INFO L87 Difference]: Start difference. First operand 151 states and 445 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:09,796 INFO L93 Difference]: Finished difference Result 182 states and 529 transitions. [2021-06-05 04:23:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:09,797 INFO L225 Difference]: With dead ends: 182 [2021-06-05 04:23:09,797 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 04:23:09,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 04:23:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2021-06-05 04:23:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0211267605633805) internal successors, (429), 142 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 429 transitions. [2021-06-05 04:23:09,799 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 429 transitions. Word has length 16 [2021-06-05 04:23:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:09,799 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 429 transitions. [2021-06-05 04:23:09,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 429 transitions. [2021-06-05 04:23:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:09,800 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:09,800 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:09,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-06-05 04:23:09,800 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1766834084, now seen corresponding path program 11 times [2021-06-05 04:23:09,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:09,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101993042] [2021-06-05 04:23:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:09,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:09,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101993042] [2021-06-05 04:23:09,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101993042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:09,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377742878] [2021-06-05 04:23:09,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:09,891 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:09,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:09,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:09,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:09,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377742878] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:09,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:09,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 04:23:09,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067696346] [2021-06-05 04:23:09,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:23:09,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:23:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:09,964 INFO L87 Difference]: Start difference. First operand 143 states and 429 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:10,167 INFO L93 Difference]: Finished difference Result 259 states and 737 transitions. [2021-06-05 04:23:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:10,169 INFO L225 Difference]: With dead ends: 259 [2021-06-05 04:23:10,169 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 04:23:10,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 180.0ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:23:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 04:23:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 151. [2021-06-05 04:23:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.1266666666666665) internal successors, (469), 150 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 469 transitions. [2021-06-05 04:23:10,172 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 469 transitions. Word has length 16 [2021-06-05 04:23:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:10,172 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 469 transitions. [2021-06-05 04:23:10,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 469 transitions. [2021-06-05 04:23:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:10,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:10,173 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:10,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable227 [2021-06-05 04:23:10,389 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1333097038, now seen corresponding path program 13 times [2021-06-05 04:23:10,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:10,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014127050] [2021-06-05 04:23:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:10,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:10,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014127050] [2021-06-05 04:23:10,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014127050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:10,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839334187] [2021-06-05 04:23:10,420 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:10,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:10,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:10,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839334187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:10,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:10,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:10,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759090692] [2021-06-05 04:23:10,499 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:10,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:10,499 INFO L87 Difference]: Start difference. First operand 151 states and 469 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:10,581 INFO L93 Difference]: Finished difference Result 245 states and 702 transitions. [2021-06-05 04:23:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:10,583 INFO L225 Difference]: With dead ends: 245 [2021-06-05 04:23:10,583 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 04:23:10,583 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 04:23:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2021-06-05 04:23:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.1265822784810124) internal successors, (494), 158 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 494 transitions. [2021-06-05 04:23:10,586 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 494 transitions. Word has length 16 [2021-06-05 04:23:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:10,586 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 494 transitions. [2021-06-05 04:23:10,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 494 transitions. [2021-06-05 04:23:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:10,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:10,587 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:10,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable228 [2021-06-05 04:23:10,789 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash 95858068, now seen corresponding path program 12 times [2021-06-05 04:23:10,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:10,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842243304] [2021-06-05 04:23:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:10,842 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:10,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842243304] [2021-06-05 04:23:10,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842243304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:10,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511574437] [2021-06-05 04:23:10,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:10,865 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:10,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:10,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:10,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511574437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:10,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:10,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 04:23:10,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027076543] [2021-06-05 04:23:10,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:23:10,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:10,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:23:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:10,937 INFO L87 Difference]: Start difference. First operand 159 states and 494 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:11,111 INFO L93 Difference]: Finished difference Result 256 states and 722 transitions. [2021-06-05 04:23:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:11,112 INFO L225 Difference]: With dead ends: 256 [2021-06-05 04:23:11,112 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 04:23:11,113 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:23:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 04:23:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2021-06-05 04:23:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 04:23:11,116 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 04:23:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:11,116 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 04:23:11,116 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 04:23:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:11,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:11,117 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:11,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:11,325 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1021881512, now seen corresponding path program 14 times [2021-06-05 04:23:11,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:11,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177840047] [2021-06-05 04:23:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:11,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:11,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177840047] [2021-06-05 04:23:11,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177840047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:11,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029609061] [2021-06-05 04:23:11,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:11,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:11,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:11,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:11,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:11,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029609061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:11,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:11,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:11,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876259771] [2021-06-05 04:23:11,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:11,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:11,454 INFO L87 Difference]: Start difference. First operand 162 states and 497 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:11,533 INFO L93 Difference]: Finished difference Result 260 states and 746 transitions. [2021-06-05 04:23:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:11,534 INFO L225 Difference]: With dead ends: 260 [2021-06-05 04:23:11,534 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 04:23:11,534 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 04:23:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 159. [2021-06-05 04:23:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.088607594936709) internal successors, (488), 158 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 488 transitions. [2021-06-05 04:23:11,537 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 488 transitions. Word has length 16 [2021-06-05 04:23:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:11,537 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 488 transitions. [2021-06-05 04:23:11,537 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 488 transitions. [2021-06-05 04:23:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:11,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:11,538 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:11,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2021-06-05 04:23:11,738 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2109417596, now seen corresponding path program 13 times [2021-06-05 04:23:11,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:11,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566563109] [2021-06-05 04:23:11,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:11,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:11,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566563109] [2021-06-05 04:23:11,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566563109] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:11,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002234579] [2021-06-05 04:23:11,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:11,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:11,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:11,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002234579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:11,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:11,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:11,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007606934] [2021-06-05 04:23:11,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:11,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:11,840 INFO L87 Difference]: Start difference. First operand 159 states and 488 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:11,938 INFO L93 Difference]: Finished difference Result 256 states and 720 transitions. [2021-06-05 04:23:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:11,939 INFO L225 Difference]: With dead ends: 256 [2021-06-05 04:23:11,939 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 04:23:11,939 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 04:23:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 154. [2021-06-05 04:23:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0718954248366015) internal successors, (470), 153 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 470 transitions. [2021-06-05 04:23:11,943 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 470 transitions. Word has length 16 [2021-06-05 04:23:11,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:11,943 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 470 transitions. [2021-06-05 04:23:11,943 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 470 transitions. [2021-06-05 04:23:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:11,943 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:11,943 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:12,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 04:23:12,157 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash -213836346, now seen corresponding path program 14 times [2021-06-05 04:23:12,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:12,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893364120] [2021-06-05 04:23:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:12,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893364120] [2021-06-05 04:23:12,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893364120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:12,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743550174] [2021-06-05 04:23:12,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:12,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:12,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:12,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:12,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743550174] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:12,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:12,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:12,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313927199] [2021-06-05 04:23:12,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:12,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:12,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:12,252 INFO L87 Difference]: Start difference. First operand 154 states and 470 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:12,327 INFO L93 Difference]: Finished difference Result 234 states and 666 transitions. [2021-06-05 04:23:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:12,327 INFO L225 Difference]: With dead ends: 234 [2021-06-05 04:23:12,327 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 04:23:12,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 04:23:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2021-06-05 04:23:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 04:23:12,330 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 04:23:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:12,330 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 04:23:12,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 04:23:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:12,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:12,330 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:12,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:12,531 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash -2074530712, now seen corresponding path program 15 times [2021-06-05 04:23:12,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:12,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329350576] [2021-06-05 04:23:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:12,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329350576] [2021-06-05 04:23:12,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329350576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:12,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:12,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:12,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368852057] [2021-06-05 04:23:12,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:12,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:12,563 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:12,674 INFO L93 Difference]: Finished difference Result 229 states and 636 transitions. [2021-06-05 04:23:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:12,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:12,675 INFO L225 Difference]: With dead ends: 229 [2021-06-05 04:23:12,675 INFO L226 Difference]: Without dead ends: 225 [2021-06-05 04:23:12,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-06-05 04:23:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2021-06-05 04:23:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.045751633986928) internal successors, (466), 153 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 466 transitions. [2021-06-05 04:23:12,678 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 466 transitions. Word has length 16 [2021-06-05 04:23:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:12,679 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 466 transitions. [2021-06-05 04:23:12,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 466 transitions. [2021-06-05 04:23:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:12,679 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:12,679 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:12,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-06-05 04:23:12,679 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2147064104, now seen corresponding path program 16 times [2021-06-05 04:23:12,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:12,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099672123] [2021-06-05 04:23:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:12,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099672123] [2021-06-05 04:23:12,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099672123] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:12,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:12,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:12,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685606251] [2021-06-05 04:23:12,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:12,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:12,716 INFO L87 Difference]: Start difference. First operand 154 states and 466 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:12,830 INFO L93 Difference]: Finished difference Result 212 states and 610 transitions. [2021-06-05 04:23:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:12,831 INFO L225 Difference]: With dead ends: 212 [2021-06-05 04:23:12,832 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 04:23:12,832 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 04:23:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2021-06-05 04:23:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0460526315789473) internal successors, (463), 152 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 463 transitions. [2021-06-05 04:23:12,835 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 463 transitions. Word has length 16 [2021-06-05 04:23:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:12,835 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 463 transitions. [2021-06-05 04:23:12,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 463 transitions. [2021-06-05 04:23:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:12,836 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:12,836 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:12,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-06-05 04:23:12,836 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:12,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1481357318, now seen corresponding path program 15 times [2021-06-05 04:23:12,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:12,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364918933] [2021-06-05 04:23:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:12,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364918933] [2021-06-05 04:23:12,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364918933] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:12,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:12,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:12,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277152431] [2021-06-05 04:23:12,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:12,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:12,878 INFO L87 Difference]: Start difference. First operand 153 states and 463 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:12,948 INFO L93 Difference]: Finished difference Result 222 states and 625 transitions. [2021-06-05 04:23:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:12,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:12,948 INFO L225 Difference]: With dead ends: 222 [2021-06-05 04:23:12,948 INFO L226 Difference]: Without dead ends: 219 [2021-06-05 04:23:12,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-06-05 04:23:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2021-06-05 04:23:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0127388535031847) internal successors, (473), 157 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 473 transitions. [2021-06-05 04:23:12,951 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 473 transitions. Word has length 16 [2021-06-05 04:23:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:12,951 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 473 transitions. [2021-06-05 04:23:12,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 473 transitions. [2021-06-05 04:23:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:12,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:12,951 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:12,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-06-05 04:23:12,952 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 384029742, now seen corresponding path program 16 times [2021-06-05 04:23:12,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:12,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216356162] [2021-06-05 04:23:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:12,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:12,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216356162] [2021-06-05 04:23:12,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216356162] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:12,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:12,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:12,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372799027] [2021-06-05 04:23:12,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:12,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:12,979 INFO L87 Difference]: Start difference. First operand 158 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:13,038 INFO L93 Difference]: Finished difference Result 209 states and 606 transitions. [2021-06-05 04:23:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:13,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:13,039 INFO L225 Difference]: With dead ends: 209 [2021-06-05 04:23:13,039 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 04:23:13,039 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 04:23:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 153. [2021-06-05 04:23:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.039473684210526) internal successors, (462), 152 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 462 transitions. [2021-06-05 04:23:13,041 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 462 transitions. Word has length 16 [2021-06-05 04:23:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:13,041 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 462 transitions. [2021-06-05 04:23:13,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 462 transitions. [2021-06-05 04:23:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:13,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:13,042 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:13,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-06-05 04:23:13,042 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1323363576, now seen corresponding path program 17 times [2021-06-05 04:23:13,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:13,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179779248] [2021-06-05 04:23:13,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:13,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:13,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179779248] [2021-06-05 04:23:13,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179779248] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:13,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988610370] [2021-06-05 04:23:13,075 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:13,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:23:13,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:13,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:13,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:13,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988610370] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:13,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:13,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:13,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777134297] [2021-06-05 04:23:13,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:13,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:13,169 INFO L87 Difference]: Start difference. First operand 153 states and 462 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:13,245 INFO L93 Difference]: Finished difference Result 214 states and 614 transitions. [2021-06-05 04:23:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:13,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:13,246 INFO L225 Difference]: With dead ends: 214 [2021-06-05 04:23:13,246 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 04:23:13,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 04:23:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 151. [2021-06-05 04:23:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.0) internal successors, (450), 150 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 450 transitions. [2021-06-05 04:23:13,248 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 450 transitions. Word has length 16 [2021-06-05 04:23:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:13,248 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 450 transitions. [2021-06-05 04:23:13,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 450 transitions. [2021-06-05 04:23:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:13,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:13,249 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:13,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2021-06-05 04:23:13,449 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1610047614, now seen corresponding path program 18 times [2021-06-05 04:23:13,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:13,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867809696] [2021-06-05 04:23:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:13,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:13,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867809696] [2021-06-05 04:23:13,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867809696] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:13,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:13,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:13,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464186453] [2021-06-05 04:23:13,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:13,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:13,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:13,479 INFO L87 Difference]: Start difference. First operand 151 states and 450 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:13,574 INFO L93 Difference]: Finished difference Result 191 states and 561 transitions. [2021-06-05 04:23:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:13,575 INFO L225 Difference]: With dead ends: 191 [2021-06-05 04:23:13,575 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 04:23:13,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 04:23:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2021-06-05 04:23:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0277777777777777) internal successors, (436), 144 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 436 transitions. [2021-06-05 04:23:13,578 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 436 transitions. Word has length 16 [2021-06-05 04:23:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:13,578 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 436 transitions. [2021-06-05 04:23:13,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 436 transitions. [2021-06-05 04:23:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:13,578 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:13,579 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:13,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-06-05 04:23:13,579 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1975020344, now seen corresponding path program 17 times [2021-06-05 04:23:13,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:13,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147475867] [2021-06-05 04:23:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:13,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:13,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147475867] [2021-06-05 04:23:13,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147475867] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:13,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532822257] [2021-06-05 04:23:13,614 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:13,651 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:13,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:13,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:13,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:13,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532822257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:13,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:13,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:13,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215394803] [2021-06-05 04:23:13,706 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:13,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:13,706 INFO L87 Difference]: Start difference. First operand 145 states and 436 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:13,788 INFO L93 Difference]: Finished difference Result 260 states and 749 transitions. [2021-06-05 04:23:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:13,789 INFO L225 Difference]: With dead ends: 260 [2021-06-05 04:23:13,789 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 04:23:13,789 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 79.1ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 04:23:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 152. [2021-06-05 04:23:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 04:23:13,792 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 04:23:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:13,792 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 04:23:13,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 04:23:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:13,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:13,793 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:13,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2021-06-05 04:23:13,997 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:13,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1124910778, now seen corresponding path program 19 times [2021-06-05 04:23:13,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:13,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599927217] [2021-06-05 04:23:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:14,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599927217] [2021-06-05 04:23:14,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599927217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481672496] [2021-06-05 04:23:14,027 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:14,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:14,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481672496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:14,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:14,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886631792] [2021-06-05 04:23:14,106 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:14,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:14,107 INFO L87 Difference]: Start difference. First operand 152 states and 467 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:14,192 INFO L93 Difference]: Finished difference Result 273 states and 794 transitions. [2021-06-05 04:23:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:14,193 INFO L225 Difference]: With dead ends: 273 [2021-06-05 04:23:14,193 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 04:23:14,193 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 52.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 04:23:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2021-06-05 04:23:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.1049382716049383) internal successors, (503), 162 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 503 transitions. [2021-06-05 04:23:14,196 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 503 transitions. Word has length 16 [2021-06-05 04:23:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:14,196 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 503 transitions. [2021-06-05 04:23:14,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 503 transitions. [2021-06-05 04:23:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:14,197 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:14,197 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:14,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-05 04:23:14,413 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 304044328, now seen corresponding path program 18 times [2021-06-05 04:23:14,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:14,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569629411] [2021-06-05 04:23:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:14,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569629411] [2021-06-05 04:23:14,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569629411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681205873] [2021-06-05 04:23:14,444 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:14,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:14,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:14,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:14,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681205873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:14,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:14,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399991962] [2021-06-05 04:23:14,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:14,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:14,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:14,545 INFO L87 Difference]: Start difference. First operand 163 states and 503 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:14,638 INFO L93 Difference]: Finished difference Result 263 states and 760 transitions. [2021-06-05 04:23:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:14,639 INFO L225 Difference]: With dead ends: 263 [2021-06-05 04:23:14,640 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 04:23:14,640 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 04:23:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 163. [2021-06-05 04:23:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0864197530864197) internal successors, (500), 162 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 500 transitions. [2021-06-05 04:23:14,644 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 500 transitions. Word has length 16 [2021-06-05 04:23:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:14,644 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 500 transitions. [2021-06-05 04:23:14,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 500 transitions. [2021-06-05 04:23:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:14,645 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:14,645 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:14,860 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:14,861 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1230067772, now seen corresponding path program 20 times [2021-06-05 04:23:14,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:14,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920771044] [2021-06-05 04:23:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:14,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920771044] [2021-06-05 04:23:14,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920771044] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100857797] [2021-06-05 04:23:14,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:14,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:14,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:14,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:14,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:14,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100857797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:14,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:14,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:14,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696308057] [2021-06-05 04:23:14,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:14,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:14,964 INFO L87 Difference]: Start difference. First operand 163 states and 500 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:15,040 INFO L93 Difference]: Finished difference Result 281 states and 820 transitions. [2021-06-05 04:23:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:15,041 INFO L225 Difference]: With dead ends: 281 [2021-06-05 04:23:15,041 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 04:23:15,041 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 04:23:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2021-06-05 04:23:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.088050314465409) internal successors, (491), 159 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 491 transitions. [2021-06-05 04:23:15,044 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 491 transitions. Word has length 16 [2021-06-05 04:23:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:15,044 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 491 transitions. [2021-06-05 04:23:15,044 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 491 transitions. [2021-06-05 04:23:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:15,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:15,044 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:15,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:15,245 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:15,245 INFO L82 PathProgramCache]: Analyzing trace with hash -569696352, now seen corresponding path program 19 times [2021-06-05 04:23:15,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:15,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091689003] [2021-06-05 04:23:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:15,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:15,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091689003] [2021-06-05 04:23:15,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091689003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:15,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954263705] [2021-06-05 04:23:15,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:15,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:15,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:15,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954263705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:15,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:15,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:15,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485395150] [2021-06-05 04:23:15,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:15,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:15,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:15,372 INFO L87 Difference]: Start difference. First operand 160 states and 491 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:15,453 INFO L93 Difference]: Finished difference Result 253 states and 725 transitions. [2021-06-05 04:23:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:15,454 INFO L225 Difference]: With dead ends: 253 [2021-06-05 04:23:15,454 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 04:23:15,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.3ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 04:23:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2021-06-05 04:23:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 04:23:15,458 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 04:23:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:15,458 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 04:23:15,458 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 04:23:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:15,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:15,459 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:15,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:15,673 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1211633746, now seen corresponding path program 21 times [2021-06-05 04:23:15,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:15,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067386357] [2021-06-05 04:23:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:15,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:15,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067386357] [2021-06-05 04:23:15,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067386357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:15,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100742873] [2021-06-05 04:23:15,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:15,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:15,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:15,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:15,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:15,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100742873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:15,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:15,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:15,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702566387] [2021-06-05 04:23:15,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:15,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:15,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:15,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:15,757 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:15,834 INFO L93 Difference]: Finished difference Result 294 states and 862 transitions. [2021-06-05 04:23:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:15,835 INFO L225 Difference]: With dead ends: 294 [2021-06-05 04:23:15,835 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 04:23:15,835 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 49.9ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 04:23:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 157. [2021-06-05 04:23:15,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 3.0705128205128207) internal successors, (479), 156 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 479 transitions. [2021-06-05 04:23:15,838 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 479 transitions. Word has length 16 [2021-06-05 04:23:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:15,838 INFO L482 AbstractCegarLoop]: Abstraction has 157 states and 479 transitions. [2021-06-05 04:23:15,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 479 transitions. [2021-06-05 04:23:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:15,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:15,838 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:16,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable256 [2021-06-05 04:23:16,039 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:16,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1044998274, now seen corresponding path program 20 times [2021-06-05 04:23:16,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:16,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743986018] [2021-06-05 04:23:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:16,106 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:16,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743986018] [2021-06-05 04:23:16,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743986018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:16,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721640612] [2021-06-05 04:23:16,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:16,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:16,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:16,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:16,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:16,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721640612] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:16,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:16,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 04:23:16,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043366777] [2021-06-05 04:23:16,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:23:16,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:16,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:23:16,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:16,198 INFO L87 Difference]: Start difference. First operand 157 states and 479 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:16,407 INFO L93 Difference]: Finished difference Result 282 states and 801 transitions. [2021-06-05 04:23:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:16,408 INFO L225 Difference]: With dead ends: 282 [2021-06-05 04:23:16,408 INFO L226 Difference]: Without dead ends: 282 [2021-06-05 04:23:16,408 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 182.6ms TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:23:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-06-05 04:23:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 165. [2021-06-05 04:23:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1646341463414633) internal successors, (519), 164 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 519 transitions. [2021-06-05 04:23:16,411 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 519 transitions. Word has length 16 [2021-06-05 04:23:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:16,411 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 519 transitions. [2021-06-05 04:23:16,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 519 transitions. [2021-06-05 04:23:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:16,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:16,411 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:16,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable257 [2021-06-05 04:23:16,612 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:16,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash 150037900, now seen corresponding path program 22 times [2021-06-05 04:23:16,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:16,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608675667] [2021-06-05 04:23:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:16,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:16,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608675667] [2021-06-05 04:23:16,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608675667] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:16,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954244002] [2021-06-05 04:23:16,663 INFO L93 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:16,705 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:16,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:16,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:16,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:16,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954244002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:16,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:16,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:16,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370282599] [2021-06-05 04:23:16,757 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:16,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:16,757 INFO L87 Difference]: Start difference. First operand 165 states and 519 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:16,843 INFO L93 Difference]: Finished difference Result 288 states and 815 transitions. [2021-06-05 04:23:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:16,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:16,845 INFO L225 Difference]: With dead ends: 288 [2021-06-05 04:23:16,845 INFO L226 Difference]: Without dead ends: 284 [2021-06-05 04:23:16,845 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-06-05 04:23:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 169. [2021-06-05 04:23:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 3.1904761904761907) internal successors, (536), 168 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 536 transitions. [2021-06-05 04:23:16,849 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 536 transitions. Word has length 16 [2021-06-05 04:23:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:16,849 INFO L482 AbstractCegarLoop]: Abstraction has 169 states and 536 transitions. [2021-06-05 04:23:16,849 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 536 transitions. [2021-06-05 04:23:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:16,849 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:16,849 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:17,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:17,065 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1578993006, now seen corresponding path program 21 times [2021-06-05 04:23:17,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:17,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115143528] [2021-06-05 04:23:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:17,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:17,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115143528] [2021-06-05 04:23:17,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115143528] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:17,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523790780] [2021-06-05 04:23:17,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:17,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:17,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:17,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:17,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:17,216 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523790780] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:17,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:17,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 04:23:17,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067649630] [2021-06-05 04:23:17,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:23:17,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:23:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:17,217 INFO L87 Difference]: Start difference. First operand 169 states and 536 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:17,405 INFO L93 Difference]: Finished difference Result 275 states and 778 transitions. [2021-06-05 04:23:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:17,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:17,406 INFO L225 Difference]: With dead ends: 275 [2021-06-05 04:23:17,406 INFO L226 Difference]: Without dead ends: 272 [2021-06-05 04:23:17,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 187.4ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:23:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-06-05 04:23:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 172. [2021-06-05 04:23:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.152046783625731) internal successors, (539), 171 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 539 transitions. [2021-06-05 04:23:17,409 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 539 transitions. Word has length 16 [2021-06-05 04:23:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:17,409 INFO L482 AbstractCegarLoop]: Abstraction has 172 states and 539 transitions. [2021-06-05 04:23:17,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 539 transitions. [2021-06-05 04:23:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:17,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:17,410 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:17,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:17,625 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1789950846, now seen corresponding path program 23 times [2021-06-05 04:23:17,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:17,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664841978] [2021-06-05 04:23:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:17,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:17,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664841978] [2021-06-05 04:23:17,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664841978] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:17,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025736186] [2021-06-05 04:23:17,655 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:17,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:17,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:17,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:17,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:17,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025736186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:17,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:17,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:17,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982602406] [2021-06-05 04:23:17,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:17,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:17,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:17,722 INFO L87 Difference]: Start difference. First operand 172 states and 539 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:17,794 INFO L93 Difference]: Finished difference Result 295 states and 843 transitions. [2021-06-05 04:23:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:17,795 INFO L225 Difference]: With dead ends: 295 [2021-06-05 04:23:17,795 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 04:23:17,795 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 60.4ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 04:23:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 166. [2021-06-05 04:23:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.121212121212121) internal successors, (515), 165 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 515 transitions. [2021-06-05 04:23:17,798 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 515 transitions. Word has length 16 [2021-06-05 04:23:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:17,798 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 515 transitions. [2021-06-05 04:23:17,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 515 transitions. [2021-06-05 04:23:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:17,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:17,798 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:18,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264,81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:18,010 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash -702414762, now seen corresponding path program 22 times [2021-06-05 04:23:18,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:18,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215878914] [2021-06-05 04:23:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:18,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:18,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215878914] [2021-06-05 04:23:18,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215878914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:18,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384310011] [2021-06-05 04:23:18,042 INFO L93 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:18,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:18,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:18,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:18,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:18,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384310011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:18,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:18,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:18,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853841284] [2021-06-05 04:23:18,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:18,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:18,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:18,121 INFO L87 Difference]: Start difference. First operand 166 states and 515 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:18,202 INFO L93 Difference]: Finished difference Result 254 states and 721 transitions. [2021-06-05 04:23:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:18,203 INFO L225 Difference]: With dead ends: 254 [2021-06-05 04:23:18,203 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 04:23:18,203 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 04:23:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 161. [2021-06-05 04:23:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.10625) internal successors, (497), 160 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 497 transitions. [2021-06-05 04:23:18,206 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 497 transitions. Word has length 16 [2021-06-05 04:23:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:18,206 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 497 transitions. [2021-06-05 04:23:18,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 497 transitions. [2021-06-05 04:23:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:18,206 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:18,206 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:18,407 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:18,408 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:18,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1269298592, now seen corresponding path program 23 times [2021-06-05 04:23:18,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:18,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595414373] [2021-06-05 04:23:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:18,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:18,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595414373] [2021-06-05 04:23:18,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595414373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:18,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980146444] [2021-06-05 04:23:18,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:18,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:18,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:18,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:18,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:18,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980146444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:18,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:18,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:18,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408027530] [2021-06-05 04:23:18,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:18,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:18,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:18,603 INFO L87 Difference]: Start difference. First operand 161 states and 497 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:18,717 INFO L93 Difference]: Finished difference Result 232 states and 667 transitions. [2021-06-05 04:23:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:18,718 INFO L225 Difference]: With dead ends: 232 [2021-06-05 04:23:18,718 INFO L226 Difference]: Without dead ends: 230 [2021-06-05 04:23:18,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-06-05 04:23:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 159. [2021-06-05 04:23:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0949367088607596) internal successors, (489), 158 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 489 transitions. [2021-06-05 04:23:18,722 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 489 transitions. Word has length 16 [2021-06-05 04:23:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:18,722 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 489 transitions. [2021-06-05 04:23:18,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 489 transitions. [2021-06-05 04:23:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:18,722 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:18,722 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:18,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable266 [2021-06-05 04:23:18,925 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -591395774, now seen corresponding path program 24 times [2021-06-05 04:23:18,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:18,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937372548] [2021-06-05 04:23:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:18,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:18,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937372548] [2021-06-05 04:23:18,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937372548] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:18,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:18,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:18,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558948051] [2021-06-05 04:23:18,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:18,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:18,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:18,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:18,957 INFO L87 Difference]: Start difference. First operand 159 states and 489 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:19,045 INFO L93 Difference]: Finished difference Result 244 states and 679 transitions. [2021-06-05 04:23:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:19,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:19,046 INFO L225 Difference]: With dead ends: 244 [2021-06-05 04:23:19,046 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 04:23:19,047 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 04:23:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 161. [2021-06-05 04:23:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.08125) internal successors, (493), 160 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 493 transitions. [2021-06-05 04:23:19,050 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 493 transitions. Word has length 16 [2021-06-05 04:23:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:19,050 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 493 transitions. [2021-06-05 04:23:19,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 493 transitions. [2021-06-05 04:23:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:19,051 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:19,051 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:19,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-06-05 04:23:19,051 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:19,052 INFO L82 PathProgramCache]: Analyzing trace with hash -664768254, now seen corresponding path program 25 times [2021-06-05 04:23:19,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:19,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336780801] [2021-06-05 04:23:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:19,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336780801] [2021-06-05 04:23:19,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336780801] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:19,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:19,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:19,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503397364] [2021-06-05 04:23:19,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:19,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:19,082 INFO L87 Difference]: Start difference. First operand 161 states and 493 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:19,151 INFO L93 Difference]: Finished difference Result 227 states and 653 transitions. [2021-06-05 04:23:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:19,152 INFO L225 Difference]: With dead ends: 227 [2021-06-05 04:23:19,152 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 04:23:19,152 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 04:23:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 160. [2021-06-05 04:23:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0817610062893084) internal successors, (490), 159 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 490 transitions. [2021-06-05 04:23:19,154 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 490 transitions. Word has length 16 [2021-06-05 04:23:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:19,154 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 490 transitions. [2021-06-05 04:23:19,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 490 transitions. [2021-06-05 04:23:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:19,155 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:19,155 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:19,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-06-05 04:23:19,155 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1330475040, now seen corresponding path program 24 times [2021-06-05 04:23:19,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:19,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939213977] [2021-06-05 04:23:19,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:19,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939213977] [2021-06-05 04:23:19,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939213977] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:19,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:19,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:19,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396938085] [2021-06-05 04:23:19,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:19,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:19,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:19,194 INFO L87 Difference]: Start difference. First operand 160 states and 490 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:19,295 INFO L93 Difference]: Finished difference Result 242 states and 676 transitions. [2021-06-05 04:23:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:19,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:19,296 INFO L225 Difference]: With dead ends: 242 [2021-06-05 04:23:19,296 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 04:23:19,296 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 04:23:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2021-06-05 04:23:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.048780487804878) internal successors, (500), 164 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 500 transitions. [2021-06-05 04:23:19,301 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 500 transitions. Word has length 16 [2021-06-05 04:23:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:19,301 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 500 transitions. [2021-06-05 04:23:19,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 500 transitions. [2021-06-05 04:23:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:19,302 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:19,302 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:19,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-06-05 04:23:19,302 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:19,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:19,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1867164680, now seen corresponding path program 25 times [2021-06-05 04:23:19,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:19,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669285653] [2021-06-05 04:23:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:19,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669285653] [2021-06-05 04:23:19,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669285653] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:19,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:19,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:19,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822879918] [2021-06-05 04:23:19,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:19,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:19,341 INFO L87 Difference]: Start difference. First operand 165 states and 500 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:19,446 INFO L93 Difference]: Finished difference Result 229 states and 657 transitions. [2021-06-05 04:23:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:19,447 INFO L225 Difference]: With dead ends: 229 [2021-06-05 04:23:19,447 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 04:23:19,447 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 04:23:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 160. [2021-06-05 04:23:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0754716981132075) internal successors, (489), 159 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 489 transitions. [2021-06-05 04:23:19,450 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 489 transitions. Word has length 16 [2021-06-05 04:23:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:19,450 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 489 transitions. [2021-06-05 04:23:19,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 489 transitions. [2021-06-05 04:23:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:19,450 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:19,450 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:19,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-06-05 04:23:19,451 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1488468782, now seen corresponding path program 26 times [2021-06-05 04:23:19,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:19,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975118142] [2021-06-05 04:23:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:19,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975118142] [2021-06-05 04:23:19,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975118142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:19,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877827429] [2021-06-05 04:23:19,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:19,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:19,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:19,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:19,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877827429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:19,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:19,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:19,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830323067] [2021-06-05 04:23:19,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:19,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:19,573 INFO L87 Difference]: Start difference. First operand 160 states and 489 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:19,681 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 04:23:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:19,682 INFO L225 Difference]: With dead ends: 257 [2021-06-05 04:23:19,682 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 04:23:19,682 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 04:23:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-06-05 04:23:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 04:23:19,688 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 04:23:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:19,688 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 04:23:19,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 04:23:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:19,689 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:19,689 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:19,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:19,909 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash -126912676, now seen corresponding path program 27 times [2021-06-05 04:23:19,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:19,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275180629] [2021-06-05 04:23:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:19,939 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:19,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275180629] [2021-06-05 04:23:19,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275180629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:19,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:19,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:19,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412332899] [2021-06-05 04:23:19,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:19,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:19,940 INFO L87 Difference]: Start difference. First operand 162 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:20,037 INFO L93 Difference]: Finished difference Result 234 states and 674 transitions. [2021-06-05 04:23:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:20,038 INFO L225 Difference]: With dead ends: 234 [2021-06-05 04:23:20,038 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 04:23:20,038 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53.7ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 04:23:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 159. [2021-06-05 04:23:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0759493670886076) internal successors, (486), 158 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 486 transitions. [2021-06-05 04:23:20,041 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 486 transitions. Word has length 16 [2021-06-05 04:23:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:20,041 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 486 transitions. [2021-06-05 04:23:20,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 486 transitions. [2021-06-05 04:23:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:20,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:20,042 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:20,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-06-05 04:23:20,042 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash -568892562, now seen corresponding path program 26 times [2021-06-05 04:23:20,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:20,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788459199] [2021-06-05 04:23:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:20,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:20,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788459199] [2021-06-05 04:23:20,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788459199] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:20,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:20,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:20,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44314604] [2021-06-05 04:23:20,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:20,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:20,072 INFO L87 Difference]: Start difference. First operand 159 states and 486 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:20,169 INFO L93 Difference]: Finished difference Result 213 states and 612 transitions. [2021-06-05 04:23:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:20,170 INFO L225 Difference]: With dead ends: 213 [2021-06-05 04:23:20,170 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 04:23:20,170 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 70.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 04:23:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 160. [2021-06-05 04:23:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0628930817610063) internal successors, (487), 159 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 487 transitions. [2021-06-05 04:23:20,173 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 487 transitions. Word has length 16 [2021-06-05 04:23:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:20,173 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 487 transitions. [2021-06-05 04:23:20,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 487 transitions. [2021-06-05 04:23:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:20,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:20,173 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:20,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-06-05 04:23:20,173 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash 857708136, now seen corresponding path program 27 times [2021-06-05 04:23:20,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:20,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033720012] [2021-06-05 04:23:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:20,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:20,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033720012] [2021-06-05 04:23:20,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033720012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:20,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:20,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:20,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098543561] [2021-06-05 04:23:20,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:20,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:20,207 INFO L87 Difference]: Start difference. First operand 160 states and 487 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:20,303 INFO L93 Difference]: Finished difference Result 210 states and 602 transitions. [2021-06-05 04:23:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:20,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:20,303 INFO L225 Difference]: With dead ends: 210 [2021-06-05 04:23:20,303 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 04:23:20,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 04:23:20,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 165. [2021-06-05 04:23:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.0304878048780486) internal successors, (497), 164 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 497 transitions. [2021-06-05 04:23:20,306 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 497 transitions. Word has length 16 [2021-06-05 04:23:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:20,306 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 497 transitions. [2021-06-05 04:23:20,306 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 497 transitions. [2021-06-05 04:23:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:20,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:20,306 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:20,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-06-05 04:23:20,306 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash -239619440, now seen corresponding path program 28 times [2021-06-05 04:23:20,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:20,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238308824] [2021-06-05 04:23:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:20,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:20,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238308824] [2021-06-05 04:23:20,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238308824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:20,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:20,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:20,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174019262] [2021-06-05 04:23:20,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:20,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:20,345 INFO L87 Difference]: Start difference. First operand 165 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:20,430 INFO L93 Difference]: Finished difference Result 197 states and 583 transitions. [2021-06-05 04:23:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:20,431 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:20,431 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 04:23:20,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 04:23:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2021-06-05 04:23:20,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.069620253164557) internal successors, (485), 158 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 485 transitions. [2021-06-05 04:23:20,433 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 485 transitions. Word has length 16 [2021-06-05 04:23:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:20,433 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 485 transitions. [2021-06-05 04:23:20,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 485 transitions. [2021-06-05 04:23:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:20,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:20,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:20,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-06-05 04:23:20,434 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1967643138, now seen corresponding path program 28 times [2021-06-05 04:23:20,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:20,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935980514] [2021-06-05 04:23:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:20,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:23:20,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:20,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935980514] [2021-06-05 04:23:20,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935980514] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:20,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606737706] [2021-06-05 04:23:20,482 INFO L93 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:20,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:20,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:20,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:20,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:20,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606737706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:20,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:20,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 04:23:20,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503425095] [2021-06-05 04:23:20,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:20,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:20,562 INFO L87 Difference]: Start difference. First operand 159 states and 485 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:20,872 INFO L93 Difference]: Finished difference Result 288 states and 829 transitions. [2021-06-05 04:23:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:23:20,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:20,874 INFO L225 Difference]: With dead ends: 288 [2021-06-05 04:23:20,874 INFO L226 Difference]: Without dead ends: 277 [2021-06-05 04:23:20,874 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 256.2ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:23:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-06-05 04:23:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2021-06-05 04:23:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 04:23:20,877 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 04:23:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:20,877 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 04:23:20,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 04:23:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:20,877 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:20,877 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:21,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable278 [2021-06-05 04:23:21,093 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1038652820, now seen corresponding path program 29 times [2021-06-05 04:23:21,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:21,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090266280] [2021-06-05 04:23:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:21,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090266280] [2021-06-05 04:23:21,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090266280] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825873133] [2021-06-05 04:23:21,120 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:21,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:21,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:21,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:21,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825873133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:21,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:21,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825658167] [2021-06-05 04:23:21,180 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:21,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:21,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:21,181 INFO L87 Difference]: Start difference. First operand 147 states and 443 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:21,252 INFO L93 Difference]: Finished difference Result 224 states and 647 transitions. [2021-06-05 04:23:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:21,253 INFO L225 Difference]: With dead ends: 224 [2021-06-05 04:23:21,253 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 04:23:21,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 49.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 04:23:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 147. [2021-06-05 04:23:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 04:23:21,256 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 04:23:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:21,256 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 04:23:21,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 04:23:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:21,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:21,256 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:21,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable279 [2021-06-05 04:23:21,457 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1592318946, now seen corresponding path program 29 times [2021-06-05 04:23:21,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:21,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569600603] [2021-06-05 04:23:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:21,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569600603] [2021-06-05 04:23:21,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569600603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061931163] [2021-06-05 04:23:21,482 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:21,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:21,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:21,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:21,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061931163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:21,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:21,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448481479] [2021-06-05 04:23:21,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:21,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:21,549 INFO L87 Difference]: Start difference. First operand 147 states and 443 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:21,622 INFO L93 Difference]: Finished difference Result 244 states and 672 transitions. [2021-06-05 04:23:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:21,623 INFO L225 Difference]: With dead ends: 244 [2021-06-05 04:23:21,623 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 04:23:21,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 57.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 04:23:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 147. [2021-06-05 04:23:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0) internal successors, (438), 146 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 438 transitions. [2021-06-05 04:23:21,625 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 438 transitions. Word has length 16 [2021-06-05 04:23:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:21,625 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 438 transitions. [2021-06-05 04:23:21,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 438 transitions. [2021-06-05 04:23:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:21,626 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:21,626 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:21,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable280 [2021-06-05 04:23:21,826 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:21,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1253778718, now seen corresponding path program 30 times [2021-06-05 04:23:21,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:21,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892634454] [2021-06-05 04:23:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:21,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892634454] [2021-06-05 04:23:21,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892634454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524150577] [2021-06-05 04:23:21,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:21,877 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:21,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:21,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:21,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:21,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524150577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:21,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:21,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:21,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957374086] [2021-06-05 04:23:21,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:21,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:21,917 INFO L87 Difference]: Start difference. First operand 147 states and 438 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:21,996 INFO L93 Difference]: Finished difference Result 248 states and 707 transitions. [2021-06-05 04:23:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:21,997 INFO L225 Difference]: With dead ends: 248 [2021-06-05 04:23:21,997 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 04:23:21,997 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 57.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 04:23:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 153. [2021-06-05 04:23:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 04:23:22,000 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 04:23:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:22,000 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 04:23:22,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 04:23:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:22,000 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:22,000 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:22,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:22,216 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1846152404, now seen corresponding path program 30 times [2021-06-05 04:23:22,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:22,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639918634] [2021-06-05 04:23:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:22,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:22,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639918634] [2021-06-05 04:23:22,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639918634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:22,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497421916] [2021-06-05 04:23:22,266 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:22,308 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:22,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:22,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:22,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:22,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497421916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:22,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:22,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:22,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272069211] [2021-06-05 04:23:22,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:22,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:22,371 INFO L87 Difference]: Start difference. First operand 153 states and 468 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:22,459 INFO L93 Difference]: Finished difference Result 264 states and 730 transitions. [2021-06-05 04:23:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:22,460 INFO L225 Difference]: With dead ends: 264 [2021-06-05 04:23:22,460 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 04:23:22,460 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 04:23:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 160. [2021-06-05 04:23:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 04:23:22,463 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 04:23:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:22,463 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 04:23:22,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 04:23:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:22,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:22,464 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:22,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:22,677 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -417197298, now seen corresponding path program 31 times [2021-06-05 04:23:22,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:22,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040532355] [2021-06-05 04:23:22,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:22,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:22,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040532355] [2021-06-05 04:23:22,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040532355] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:22,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711370962] [2021-06-05 04:23:22,710 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:22,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:22,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:22,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711370962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:22,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:22,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:22,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449094912] [2021-06-05 04:23:22,777 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:22,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:22,778 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:22,847 INFO L93 Difference]: Finished difference Result 231 states and 665 transitions. [2021-06-05 04:23:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:22,848 INFO L225 Difference]: With dead ends: 231 [2021-06-05 04:23:22,848 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 04:23:22,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 04:23:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2021-06-05 04:23:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0308641975308643) internal successors, (491), 162 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 491 transitions. [2021-06-05 04:23:22,850 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 491 transitions. Word has length 16 [2021-06-05 04:23:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:22,850 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 491 transitions. [2021-06-05 04:23:22,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 491 transitions. [2021-06-05 04:23:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:22,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:22,850 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:23,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:23,051 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 508826146, now seen corresponding path program 31 times [2021-06-05 04:23:23,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:23,051 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769869565] [2021-06-05 04:23:23,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:23,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769869565] [2021-06-05 04:23:23,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769869565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57626918] [2021-06-05 04:23:23,083 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:23,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:23,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57626918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:23,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:23,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183537010] [2021-06-05 04:23:23,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:23,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:23,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:23,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:23,163 INFO L87 Difference]: Start difference. First operand 163 states and 491 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:23,241 INFO L93 Difference]: Finished difference Result 249 states and 699 transitions. [2021-06-05 04:23:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:23,242 INFO L225 Difference]: With dead ends: 249 [2021-06-05 04:23:23,242 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 04:23:23,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 77.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 04:23:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 04:23:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 04:23:23,245 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 04:23:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:23,245 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 04:23:23,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 04:23:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:23,245 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:23,245 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:23,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290,91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:23,446 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash 991501460, now seen corresponding path program 32 times [2021-06-05 04:23:23,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:23,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595392800] [2021-06-05 04:23:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:23,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595392800] [2021-06-05 04:23:23,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595392800] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906792714] [2021-06-05 04:23:23,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:23,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:23,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:23,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:23,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906792714] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:23,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:23,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620032023] [2021-06-05 04:23:23,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:23,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:23,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:23,530 INFO L87 Difference]: Start difference. First operand 148 states and 444 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:23,616 INFO L93 Difference]: Finished difference Result 304 states and 875 transitions. [2021-06-05 04:23:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:23,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:23,617 INFO L225 Difference]: With dead ends: 304 [2021-06-05 04:23:23,617 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 04:23:23,617 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 50.0ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 04:23:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 152. [2021-06-05 04:23:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.019867549668874) internal successors, (456), 151 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 456 transitions. [2021-06-05 04:23:23,619 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 456 transitions. Word has length 16 [2021-06-05 04:23:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:23,620 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 456 transitions. [2021-06-05 04:23:23,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 456 transitions. [2021-06-05 04:23:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:23,620 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:23,620 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:23,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable291 [2021-06-05 04:23:23,837 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash -501516022, now seen corresponding path program 33 times [2021-06-05 04:23:23,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:23,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904186746] [2021-06-05 04:23:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:23,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904186746] [2021-06-05 04:23:23,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904186746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215222120] [2021-06-05 04:23:23,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:23,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:23,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:23,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:23,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:23,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215222120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:23,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:23,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:23,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006604891] [2021-06-05 04:23:23,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:23,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:23,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:23,962 INFO L87 Difference]: Start difference. First operand 152 states and 456 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:24,067 INFO L93 Difference]: Finished difference Result 279 states and 796 transitions. [2021-06-05 04:23:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:24,068 INFO L225 Difference]: With dead ends: 279 [2021-06-05 04:23:24,068 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 04:23:24,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 04:23:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 154. [2021-06-05 04:23:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0326797385620914) internal successors, (464), 153 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 464 transitions. [2021-06-05 04:23:24,071 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 464 transitions. Word has length 16 [2021-06-05 04:23:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:24,071 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 464 transitions. [2021-06-05 04:23:24,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 464 transitions. [2021-06-05 04:23:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:24,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:24,071 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:24,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:24,272 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 108641226, now seen corresponding path program 34 times [2021-06-05 04:23:24,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:24,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048936454] [2021-06-05 04:23:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:24,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:24,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048936454] [2021-06-05 04:23:24,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048936454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:24,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990394077] [2021-06-05 04:23:24,297 INFO L93 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:24,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:24,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:24,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:24,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:24,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990394077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:24,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:24,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:24,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918582302] [2021-06-05 04:23:24,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:24,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:24,361 INFO L87 Difference]: Start difference. First operand 154 states and 464 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:24,434 INFO L93 Difference]: Finished difference Result 255 states and 738 transitions. [2021-06-05 04:23:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:24,435 INFO L225 Difference]: With dead ends: 255 [2021-06-05 04:23:24,435 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 04:23:24,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 04:23:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2021-06-05 04:23:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 04:23:24,437 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 04:23:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:24,437 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 04:23:24,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 04:23:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:24,438 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:24,438 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:24,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable293 [2021-06-05 04:23:24,638 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 82711532, now seen corresponding path program 32 times [2021-06-05 04:23:24,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:24,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326925653] [2021-06-05 04:23:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:24,671 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:24,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326925653] [2021-06-05 04:23:24,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326925653] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:24,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:24,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:24,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456720568] [2021-06-05 04:23:24,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:24,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:24,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:24,672 INFO L87 Difference]: Start difference. First operand 148 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:24,757 INFO L93 Difference]: Finished difference Result 276 states and 746 transitions. [2021-06-05 04:23:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:24,758 INFO L225 Difference]: With dead ends: 276 [2021-06-05 04:23:24,758 INFO L226 Difference]: Without dead ends: 266 [2021-06-05 04:23:24,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-06-05 04:23:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 150. [2021-06-05 04:23:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.9932885906040267) internal successors, (446), 149 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 446 transitions. [2021-06-05 04:23:24,761 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 446 transitions. Word has length 16 [2021-06-05 04:23:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:24,761 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 446 transitions. [2021-06-05 04:23:24,762 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 446 transitions. [2021-06-05 04:23:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:24,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:24,762 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:24,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-06-05 04:23:24,762 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1741550036, now seen corresponding path program 33 times [2021-06-05 04:23:24,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:24,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998882313] [2021-06-05 04:23:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:24,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:24,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998882313] [2021-06-05 04:23:24,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998882313] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:24,792 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:24,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:24,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460858620] [2021-06-05 04:23:24,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:24,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:24,793 INFO L87 Difference]: Start difference. First operand 150 states and 446 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:24,874 INFO L93 Difference]: Finished difference Result 269 states and 726 transitions. [2021-06-05 04:23:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:24,875 INFO L225 Difference]: With dead ends: 269 [2021-06-05 04:23:24,875 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 04:23:24,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 04:23:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 156. [2021-06-05 04:23:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.9548387096774196) internal successors, (458), 155 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 458 transitions. [2021-06-05 04:23:24,878 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 458 transitions. Word has length 16 [2021-06-05 04:23:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:24,878 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 458 transitions. [2021-06-05 04:23:24,879 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 458 transitions. [2021-06-05 04:23:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:24,879 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:24,879 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:24,879 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-06-05 04:23:24,879 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1814922516, now seen corresponding path program 34 times [2021-06-05 04:23:24,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:24,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411640] [2021-06-05 04:23:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:24,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:24,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411640] [2021-06-05 04:23:24,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:24,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:24,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:24,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456612724] [2021-06-05 04:23:24,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:24,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:24,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:24,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:24,910 INFO L87 Difference]: Start difference. First operand 156 states and 458 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:24,995 INFO L93 Difference]: Finished difference Result 254 states and 704 transitions. [2021-06-05 04:23:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:24,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:24,996 INFO L225 Difference]: With dead ends: 254 [2021-06-05 04:23:24,996 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 04:23:24,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 04:23:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 04:23:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.006802721088435) internal successors, (442), 147 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 442 transitions. [2021-06-05 04:23:24,999 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 442 transitions. Word has length 16 [2021-06-05 04:23:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:24,999 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 442 transitions. [2021-06-05 04:23:24,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 442 transitions. [2021-06-05 04:23:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:25,000 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:25,000 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:25,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-06-05 04:23:25,000 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:25,000 INFO L82 PathProgramCache]: Analyzing trace with hash 499376906, now seen corresponding path program 35 times [2021-06-05 04:23:25,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:25,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943975682] [2021-06-05 04:23:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:25,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:25,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943975682] [2021-06-05 04:23:25,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943975682] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:25,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329796388] [2021-06-05 04:23:25,053 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:25,083 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:25,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:25,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:25,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:25,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329796388] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:25,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:25,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:25,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062845235] [2021-06-05 04:23:25,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:25,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:25,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:25,160 INFO L87 Difference]: Start difference. First operand 148 states and 442 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:25,377 INFO L93 Difference]: Finished difference Result 297 states and 849 transitions. [2021-06-05 04:23:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:25,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:25,378 INFO L225 Difference]: With dead ends: 297 [2021-06-05 04:23:25,378 INFO L226 Difference]: Without dead ends: 297 [2021-06-05 04:23:25,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-06-05 04:23:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 156. [2021-06-05 04:23:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.109677419354839) internal successors, (482), 155 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 482 transitions. [2021-06-05 04:23:25,382 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 482 transitions. Word has length 16 [2021-06-05 04:23:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:25,382 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 482 transitions. [2021-06-05 04:23:25,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 482 transitions. [2021-06-05 04:23:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:25,382 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:25,382 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:25,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable299 [2021-06-05 04:23:25,583 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1694413080, now seen corresponding path program 35 times [2021-06-05 04:23:25,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:25,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147371676] [2021-06-05 04:23:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:25,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:25,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147371676] [2021-06-05 04:23:25,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147371676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:25,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921247487] [2021-06-05 04:23:25,619 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:25,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:25,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:25,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:25,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:25,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921247487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:25,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:25,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:25,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871054903] [2021-06-05 04:23:25,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:25,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:25,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:25,704 INFO L87 Difference]: Start difference. First operand 156 states and 482 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:25,795 INFO L93 Difference]: Finished difference Result 308 states and 850 transitions. [2021-06-05 04:23:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:25,796 INFO L225 Difference]: With dead ends: 308 [2021-06-05 04:23:25,796 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 04:23:25,796 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 73.0ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 04:23:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 164. [2021-06-05 04:23:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.1104294478527605) internal successors, (507), 163 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 507 transitions. [2021-06-05 04:23:25,798 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 507 transitions. Word has length 16 [2021-06-05 04:23:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:25,798 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 507 transitions. [2021-06-05 04:23:25,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 507 transitions. [2021-06-05 04:23:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:25,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:25,799 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:25,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 04:23:25,999 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:26,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1171599110, now seen corresponding path program 36 times [2021-06-05 04:23:26,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:26,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806265830] [2021-06-05 04:23:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:26,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:26,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806265830] [2021-06-05 04:23:26,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806265830] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:26,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466149215] [2021-06-05 04:23:26,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:26,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:26,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:26,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:26,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:26,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466149215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:26,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:26,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:26,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712607214] [2021-06-05 04:23:26,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:26,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:26,180 INFO L87 Difference]: Start difference. First operand 164 states and 507 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:26,370 INFO L93 Difference]: Finished difference Result 297 states and 840 transitions. [2021-06-05 04:23:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:26,371 INFO L225 Difference]: With dead ends: 297 [2021-06-05 04:23:26,371 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 04:23:26,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 168.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 04:23:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 161. [2021-06-05 04:23:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.05625) internal successors, (489), 160 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 489 transitions. [2021-06-05 04:23:26,375 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 489 transitions. Word has length 16 [2021-06-05 04:23:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:26,375 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 489 transitions. [2021-06-05 04:23:26,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 489 transitions. [2021-06-05 04:23:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:26,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:26,375 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:26,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable303 [2021-06-05 04:23:26,585 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash -245575666, now seen corresponding path program 36 times [2021-06-05 04:23:26,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:26,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665619125] [2021-06-05 04:23:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:26,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:26,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665619125] [2021-06-05 04:23:26,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665619125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:26,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383085509] [2021-06-05 04:23:26,619 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:26,659 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:26,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:26,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:26,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:26,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383085509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:26,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:26,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:26,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804497571] [2021-06-05 04:23:26,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:26,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:26,715 INFO L87 Difference]: Start difference. First operand 161 states and 489 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:26,792 INFO L93 Difference]: Finished difference Result 317 states and 873 transitions. [2021-06-05 04:23:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:26,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:26,793 INFO L225 Difference]: With dead ends: 317 [2021-06-05 04:23:26,793 INFO L226 Difference]: Without dead ends: 317 [2021-06-05 04:23:26,793 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-06-05 04:23:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2021-06-05 04:23:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 04:23:26,795 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 04:23:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:26,795 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 04:23:26,795 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 04:23:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:26,796 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:26,796 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:26,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306,98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:26,996 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash 841960418, now seen corresponding path program 37 times [2021-06-05 04:23:26,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:26,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801990253] [2021-06-05 04:23:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:27,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801990253] [2021-06-05 04:23:27,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801990253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:27,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906316144] [2021-06-05 04:23:27,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:27,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:27,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906316144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:27,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:27,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:27,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283107283] [2021-06-05 04:23:27,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:27,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:27,110 INFO L87 Difference]: Start difference. First operand 158 states and 480 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:27,191 INFO L93 Difference]: Finished difference Result 295 states and 832 transitions. [2021-06-05 04:23:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:27,192 INFO L225 Difference]: With dead ends: 295 [2021-06-05 04:23:27,192 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 04:23:27,193 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 04:23:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2021-06-05 04:23:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 04:23:27,195 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 04:23:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:27,195 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 04:23:27,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 04:23:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:27,195 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:27,195 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:27,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:27,396 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1481293524, now seen corresponding path program 38 times [2021-06-05 04:23:27,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:27,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024789248] [2021-06-05 04:23:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:27,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024789248] [2021-06-05 04:23:27,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024789248] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:27,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174303872] [2021-06-05 04:23:27,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:27,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:27,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:27,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:27,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174303872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:27,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:27,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:27,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749993851] [2021-06-05 04:23:27,492 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:27,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:27,492 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:27,577 INFO L93 Difference]: Finished difference Result 273 states and 778 transitions. [2021-06-05 04:23:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:27,578 INFO L225 Difference]: With dead ends: 273 [2021-06-05 04:23:27,578 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 04:23:27,578 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 04:23:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 04:23:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 04:23:27,581 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 04:23:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:27,582 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 04:23:27,582 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 04:23:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:27,582 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:27,582 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:27,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable308 [2021-06-05 04:23:27,805 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash 952979406, now seen corresponding path program 37 times [2021-06-05 04:23:27,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:27,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496798207] [2021-06-05 04:23:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:27,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496798207] [2021-06-05 04:23:27,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496798207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:27,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:27,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:27,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147125579] [2021-06-05 04:23:27,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:27,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:27,841 INFO L87 Difference]: Start difference. First operand 158 states and 480 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:27,926 INFO L93 Difference]: Finished difference Result 296 states and 795 transitions. [2021-06-05 04:23:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:27,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:27,928 INFO L225 Difference]: With dead ends: 296 [2021-06-05 04:23:27,928 INFO L226 Difference]: Without dead ends: 292 [2021-06-05 04:23:27,928 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-06-05 04:23:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 160. [2021-06-05 04:23:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0440251572327046) internal successors, (484), 159 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 484 transitions. [2021-06-05 04:23:27,931 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 484 transitions. Word has length 16 [2021-06-05 04:23:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:27,931 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 484 transitions. [2021-06-05 04:23:27,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 484 transitions. [2021-06-05 04:23:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:27,932 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:27,932 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:27,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-06-05 04:23:27,932 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash 879606926, now seen corresponding path program 38 times [2021-06-05 04:23:27,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:27,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140572037] [2021-06-05 04:23:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:27,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:27,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140572037] [2021-06-05 04:23:27,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140572037] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:27,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:27,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:27,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83856073] [2021-06-05 04:23:27,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:27,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:27,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:27,965 INFO L87 Difference]: Start difference. First operand 160 states and 484 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:28,056 INFO L93 Difference]: Finished difference Result 279 states and 769 transitions. [2021-06-05 04:23:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:28,057 INFO L225 Difference]: With dead ends: 279 [2021-06-05 04:23:28,057 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 04:23:28,057 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 04:23:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2021-06-05 04:23:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0443037974683542) internal successors, (481), 158 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 481 transitions. [2021-06-05 04:23:28,060 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 481 transitions. Word has length 16 [2021-06-05 04:23:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:28,061 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 481 transitions. [2021-06-05 04:23:28,061 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 481 transitions. [2021-06-05 04:23:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:28,062 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:28,062 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:28,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-06-05 04:23:28,062 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash 213900140, now seen corresponding path program 39 times [2021-06-05 04:23:28,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:28,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037502525] [2021-06-05 04:23:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:28,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037502525] [2021-06-05 04:23:28,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037502525] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:28,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:28,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:28,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244748132] [2021-06-05 04:23:28,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:28,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:28,091 INFO L87 Difference]: Start difference. First operand 159 states and 481 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:28,186 INFO L93 Difference]: Finished difference Result 259 states and 730 transitions. [2021-06-05 04:23:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:28,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:28,187 INFO L225 Difference]: With dead ends: 259 [2021-06-05 04:23:28,187 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 04:23:28,187 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 04:23:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 161. [2021-06-05 04:23:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.03125) internal successors, (485), 160 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 485 transitions. [2021-06-05 04:23:28,190 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 485 transitions. Word has length 16 [2021-06-05 04:23:28,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:28,190 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 485 transitions. [2021-06-05 04:23:28,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 485 transitions. [2021-06-05 04:23:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:28,191 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:28,192 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:28,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2021-06-05 04:23:28,194 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash -883427436, now seen corresponding path program 40 times [2021-06-05 04:23:28,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:28,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221971039] [2021-06-05 04:23:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:28,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221971039] [2021-06-05 04:23:28,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221971039] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:28,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:28,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:28,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215754699] [2021-06-05 04:23:28,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:28,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:28,235 INFO L87 Difference]: Start difference. First operand 161 states and 485 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:28,330 INFO L93 Difference]: Finished difference Result 245 states and 709 transitions. [2021-06-05 04:23:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:28,331 INFO L225 Difference]: With dead ends: 245 [2021-06-05 04:23:28,331 INFO L226 Difference]: Without dead ends: 242 [2021-06-05 04:23:28,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-06-05 04:23:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 160. [2021-06-05 04:23:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0314465408805034) internal successors, (482), 159 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 482 transitions. [2021-06-05 04:23:28,339 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 482 transitions. Word has length 16 [2021-06-05 04:23:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:28,339 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 482 transitions. [2021-06-05 04:23:28,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 482 transitions. [2021-06-05 04:23:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:28,340 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:28,340 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:28,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2021-06-05 04:23:28,340 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:28,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash 55906398, now seen corresponding path program 39 times [2021-06-05 04:23:28,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:28,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614903891] [2021-06-05 04:23:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:28,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614903891] [2021-06-05 04:23:28,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614903891] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:28,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737291580] [2021-06-05 04:23:28,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:28,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:23:28,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:28,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:28,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737291580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:28,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:28,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:28,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352134502] [2021-06-05 04:23:28,476 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:28,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:28,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:28,477 INFO L87 Difference]: Start difference. First operand 160 states and 482 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:28,583 INFO L93 Difference]: Finished difference Result 285 states and 786 transitions. [2021-06-05 04:23:28,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:28,583 INFO L225 Difference]: With dead ends: 285 [2021-06-05 04:23:28,584 INFO L226 Difference]: Without dead ends: 285 [2021-06-05 04:23:28,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-06-05 04:23:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 158. [2021-06-05 04:23:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9936305732484074) internal successors, (470), 157 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 470 transitions. [2021-06-05 04:23:28,586 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 470 transitions. Word has length 16 [2021-06-05 04:23:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:28,586 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 470 transitions. [2021-06-05 04:23:28,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 470 transitions. [2021-06-05 04:23:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:28,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:28,587 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:28,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:28,787 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1417462504, now seen corresponding path program 40 times [2021-06-05 04:23:28,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:28,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558711137] [2021-06-05 04:23:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:28,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558711137] [2021-06-05 04:23:28,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558711137] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:28,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:28,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:28,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266713853] [2021-06-05 04:23:28,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:28,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:28,822 INFO L87 Difference]: Start difference. First operand 158 states and 470 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:28,902 INFO L93 Difference]: Finished difference Result 259 states and 722 transitions. [2021-06-05 04:23:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:28,903 INFO L225 Difference]: With dead ends: 259 [2021-06-05 04:23:28,903 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 04:23:28,903 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 04:23:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 148. [2021-06-05 04:23:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0136054421768708) internal successors, (443), 147 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 443 transitions. [2021-06-05 04:23:28,905 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 443 transitions. Word has length 16 [2021-06-05 04:23:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:28,905 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 443 transitions. [2021-06-05 04:23:28,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 443 transitions. [2021-06-05 04:23:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:28,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:28,905 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:28,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-06-05 04:23:28,906 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash 105703180, now seen corresponding path program 41 times [2021-06-05 04:23:28,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:28,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926652520] [2021-06-05 04:23:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:28,939 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:28,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926652520] [2021-06-05 04:23:28,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926652520] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:28,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070993006] [2021-06-05 04:23:28,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:28,971 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:23:28,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:28,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:28,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:29,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070993006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:29,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:29,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:29,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502716795] [2021-06-05 04:23:29,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:29,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:29,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:29,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:29,004 INFO L87 Difference]: Start difference. First operand 148 states and 443 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:29,076 INFO L93 Difference]: Finished difference Result 245 states and 701 transitions. [2021-06-05 04:23:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:29,077 INFO L225 Difference]: With dead ends: 245 [2021-06-05 04:23:29,077 INFO L226 Difference]: Without dead ends: 245 [2021-06-05 04:23:29,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-06-05 04:23:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2021-06-05 04:23:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0220588235294117) internal successors, (411), 136 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 411 transitions. [2021-06-05 04:23:29,079 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 411 transitions. Word has length 16 [2021-06-05 04:23:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:29,079 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 411 transitions. [2021-06-05 04:23:29,079 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 411 transitions. [2021-06-05 04:23:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:29,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:29,079 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:29,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable317 [2021-06-05 04:23:29,285 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:29,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1387314302, now seen corresponding path program 42 times [2021-06-05 04:23:29,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:29,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417969515] [2021-06-05 04:23:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:29,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:29,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417969515] [2021-06-05 04:23:29,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417969515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:29,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433591986] [2021-06-05 04:23:29,327 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:29,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:29,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:29,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:29,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:29,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433591986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:29,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:29,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:29,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923174701] [2021-06-05 04:23:29,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:29,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:29,402 INFO L87 Difference]: Start difference. First operand 137 states and 411 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:29,508 INFO L93 Difference]: Finished difference Result 240 states and 665 transitions. [2021-06-05 04:23:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:29,509 INFO L225 Difference]: With dead ends: 240 [2021-06-05 04:23:29,509 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 04:23:29,509 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 04:23:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 04:23:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9776119402985075) internal successors, (399), 134 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 399 transitions. [2021-06-05 04:23:29,512 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 399 transitions. Word has length 16 [2021-06-05 04:23:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:29,512 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 399 transitions. [2021-06-05 04:23:29,512 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 399 transitions. [2021-06-05 04:23:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:29,513 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:29,514 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:29,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318,103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:29,729 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash -777157054, now seen corresponding path program 43 times [2021-06-05 04:23:29,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:29,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126947784] [2021-06-05 04:23:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:29,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:29,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126947784] [2021-06-05 04:23:29,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126947784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:29,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583229224] [2021-06-05 04:23:29,756 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:29,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:29,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:29,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583229224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:29,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:29,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:29,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541454624] [2021-06-05 04:23:29,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:29,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:29,815 INFO L87 Difference]: Start difference. First operand 135 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:29,912 INFO L93 Difference]: Finished difference Result 216 states and 610 transitions. [2021-06-05 04:23:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:29,913 INFO L225 Difference]: With dead ends: 216 [2021-06-05 04:23:29,913 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 04:23:29,913 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 04:23:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 125. [2021-06-05 04:23:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.9919354838709675) internal successors, (371), 124 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 371 transitions. [2021-06-05 04:23:29,915 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 371 transitions. Word has length 16 [2021-06-05 04:23:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:29,915 INFO L482 AbstractCegarLoop]: Abstraction has 125 states and 371 transitions. [2021-06-05 04:23:29,915 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 371 transitions. [2021-06-05 04:23:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:29,915 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:29,915 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:30,115 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable319 [2021-06-05 04:23:30,116 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash 276142176, now seen corresponding path program 44 times [2021-06-05 04:23:30,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:30,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260056563] [2021-06-05 04:23:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:30,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260056563] [2021-06-05 04:23:30,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260056563] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560822269] [2021-06-05 04:23:30,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:30,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:30,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:30,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:30,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560822269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:30,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:30,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115204860] [2021-06-05 04:23:30,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:30,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:30,215 INFO L87 Difference]: Start difference. First operand 125 states and 371 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:30,299 INFO L93 Difference]: Finished difference Result 197 states and 550 transitions. [2021-06-05 04:23:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:30,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:30,300 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:30,300 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 04:23:30,300 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 04:23:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2021-06-05 04:23:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 387 transitions. [2021-06-05 04:23:30,302 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 387 transitions. Word has length 16 [2021-06-05 04:23:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:30,302 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 387 transitions. [2021-06-05 04:23:30,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 387 transitions. [2021-06-05 04:23:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:30,302 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:30,303 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:30,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable322 [2021-06-05 04:23:30,503 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash 886299424, now seen corresponding path program 45 times [2021-06-05 04:23:30,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:30,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973756981] [2021-06-05 04:23:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:30,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973756981] [2021-06-05 04:23:30,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973756981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778541585] [2021-06-05 04:23:30,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:30,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:30,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:30,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:30,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778541585] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:30,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:30,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037860666] [2021-06-05 04:23:30,600 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:30,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:30,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:30,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:30,600 INFO L87 Difference]: Start difference. First operand 129 states and 387 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:30,703 INFO L93 Difference]: Finished difference Result 199 states and 552 transitions. [2021-06-05 04:23:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:30,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:30,703 INFO L225 Difference]: With dead ends: 199 [2021-06-05 04:23:30,703 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 04:23:30,703 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 04:23:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-06-05 04:23:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 3.007936507936508) internal successors, (379), 126 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 379 transitions. [2021-06-05 04:23:30,705 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 379 transitions. Word has length 16 [2021-06-05 04:23:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:30,705 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 379 transitions. [2021-06-05 04:23:30,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 379 transitions. [2021-06-05 04:23:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:30,705 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:30,705 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:30,906 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable323 [2021-06-05 04:23:30,906 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:30,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:30,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1804249614, now seen corresponding path program 46 times [2021-06-05 04:23:30,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:30,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054496417] [2021-06-05 04:23:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:30,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054496417] [2021-06-05 04:23:30,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054496417] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635916639] [2021-06-05 04:23:30,929 INFO L93 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:30,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:30,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:30,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:30,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:30,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635916639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:30,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:30,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:30,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009307897] [2021-06-05 04:23:30,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:30,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:30,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:30,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:30,995 INFO L87 Difference]: Start difference. First operand 127 states and 379 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,077 INFO L93 Difference]: Finished difference Result 178 states and 504 transitions. [2021-06-05 04:23:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,088 INFO L225 Difference]: With dead ends: 178 [2021-06-05 04:23:31,088 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 04:23:31,088 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 04:23:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2021-06-05 04:23:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.016260162601626) internal successors, (371), 123 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 371 transitions. [2021-06-05 04:23:31,090 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 371 transitions. Word has length 16 [2021-06-05 04:23:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,090 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 371 transitions. [2021-06-05 04:23:31,090 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 371 transitions. [2021-06-05 04:23:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,090 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,090 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:31,305 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1122947330, now seen corresponding path program 41 times [2021-06-05 04:23:31,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237042998] [2021-06-05 04:23:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237042998] [2021-06-05 04:23:31,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237042998] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291031760] [2021-06-05 04:23:31,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,330 INFO L87 Difference]: Start difference. First operand 124 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,395 INFO L93 Difference]: Finished difference Result 187 states and 507 transitions. [2021-06-05 04:23:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,396 INFO L225 Difference]: With dead ends: 187 [2021-06-05 04:23:31,396 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 04:23:31,396 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 04:23:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 128. [2021-06-05 04:23:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.968503937007874) internal successors, (377), 127 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 377 transitions. [2021-06-05 04:23:31,398 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 377 transitions. Word has length 16 [2021-06-05 04:23:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,398 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 377 transitions. [2021-06-05 04:23:31,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 377 transitions. [2021-06-05 04:23:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,398 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,398 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2021-06-05 04:23:31,398 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -701314238, now seen corresponding path program 42 times [2021-06-05 04:23:31,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478561812] [2021-06-05 04:23:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478561812] [2021-06-05 04:23:31,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478561812] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523584368] [2021-06-05 04:23:31,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,439 INFO L87 Difference]: Start difference. First operand 128 states and 377 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,529 INFO L93 Difference]: Finished difference Result 195 states and 514 transitions. [2021-06-05 04:23:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,530 INFO L225 Difference]: With dead ends: 195 [2021-06-05 04:23:31,530 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 04:23:31,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 04:23:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2021-06-05 04:23:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.924812030075188) internal successors, (389), 133 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 389 transitions. [2021-06-05 04:23:31,532 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 389 transitions. Word has length 16 [2021-06-05 04:23:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,532 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 389 transitions. [2021-06-05 04:23:31,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 389 transitions. [2021-06-05 04:23:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,532 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,532 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2021-06-05 04:23:31,532 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash -774686718, now seen corresponding path program 43 times [2021-06-05 04:23:31,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531069182] [2021-06-05 04:23:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,558 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531069182] [2021-06-05 04:23:31,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531069182] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,558 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896574631] [2021-06-05 04:23:31,558 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,558 INFO L87 Difference]: Start difference. First operand 134 states and 389 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,648 INFO L93 Difference]: Finished difference Result 180 states and 492 transitions. [2021-06-05 04:23:31,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,648 INFO L225 Difference]: With dead ends: 180 [2021-06-05 04:23:31,648 INFO L226 Difference]: Without dead ends: 175 [2021-06-05 04:23:31,649 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-06-05 04:23:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2021-06-05 04:23:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.984) internal successors, (373), 125 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 373 transitions. [2021-06-05 04:23:31,650 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 373 transitions. Word has length 16 [2021-06-05 04:23:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,650 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 373 transitions. [2021-06-05 04:23:31,650 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 373 transitions. [2021-06-05 04:23:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,651 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-06-05 04:23:31,651 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1714006770, now seen corresponding path program 44 times [2021-06-05 04:23:31,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920703479] [2021-06-05 04:23:31,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,691 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920703479] [2021-06-05 04:23:31,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920703479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989536925] [2021-06-05 04:23:31,691 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,692 INFO L87 Difference]: Start difference. First operand 126 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,783 INFO L93 Difference]: Finished difference Result 178 states and 483 transitions. [2021-06-05 04:23:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,784 INFO L225 Difference]: With dead ends: 178 [2021-06-05 04:23:31,784 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 04:23:31,784 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 04:23:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2021-06-05 04:23:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.9323308270676693) internal successors, (390), 133 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 390 transitions. [2021-06-05 04:23:31,786 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 390 transitions. Word has length 16 [2021-06-05 04:23:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,786 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 390 transitions. [2021-06-05 04:23:31,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 390 transitions. [2021-06-05 04:23:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,786 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,786 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2021-06-05 04:23:31,786 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1787379250, now seen corresponding path program 45 times [2021-06-05 04:23:31,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132903532] [2021-06-05 04:23:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,825 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132903532] [2021-06-05 04:23:31,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132903532] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711779837] [2021-06-05 04:23:31,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,826 INFO L87 Difference]: Start difference. First operand 134 states and 390 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,902 INFO L93 Difference]: Finished difference Result 176 states and 480 transitions. [2021-06-05 04:23:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,902 INFO L225 Difference]: With dead ends: 176 [2021-06-05 04:23:31,902 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 04:23:31,903 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 04:23:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2021-06-05 04:23:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 04:23:31,905 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 16 [2021-06-05 04:23:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,905 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 04:23:31,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 04:23:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,906 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,906 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2021-06-05 04:23:31,906 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1784753474, now seen corresponding path program 46 times [2021-06-05 04:23:31,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89127749] [2021-06-05 04:23:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:31,931 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:31,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89127749] [2021-06-05 04:23:31,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89127749] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:31,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:31,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:31,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234724489] [2021-06-05 04:23:31,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:31,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:31,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:31,932 INFO L87 Difference]: Start difference. First operand 133 states and 387 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:31,990 INFO L93 Difference]: Finished difference Result 162 states and 458 transitions. [2021-06-05 04:23:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:31,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:31,991 INFO L225 Difference]: With dead ends: 162 [2021-06-05 04:23:31,991 INFO L226 Difference]: Without dead ends: 155 [2021-06-05 04:23:31,991 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-06-05 04:23:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2021-06-05 04:23:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.0) internal successors, (369), 123 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 369 transitions. [2021-06-05 04:23:31,992 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 369 transitions. Word has length 16 [2021-06-05 04:23:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:31,992 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 369 transitions. [2021-06-05 04:23:31,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 369 transitions. [2021-06-05 04:23:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:31,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:31,993 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:31,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2021-06-05 04:23:31,993 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -829320514, now seen corresponding path program 47 times [2021-06-05 04:23:31,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:31,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746632426] [2021-06-05 04:23:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:32,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:32,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746632426] [2021-06-05 04:23:32,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746632426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:32,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538172073] [2021-06-05 04:23:32,039 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:32,062 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:32,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:32,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:32,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:32,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538172073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:32,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:32,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:32,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802691899] [2021-06-05 04:23:32,123 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:32,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:32,124 INFO L87 Difference]: Start difference. First operand 124 states and 369 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:32,259 INFO L93 Difference]: Finished difference Result 206 states and 593 transitions. [2021-06-05 04:23:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:32,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:32,260 INFO L225 Difference]: With dead ends: 206 [2021-06-05 04:23:32,260 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 04:23:32,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 129.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:23:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 04:23:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 134. [2021-06-05 04:23:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1503759398496243) internal successors, (419), 133 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 419 transitions. [2021-06-05 04:23:32,262 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 419 transitions. Word has length 16 [2021-06-05 04:23:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:32,262 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 419 transitions. [2021-06-05 04:23:32,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 419 transitions. [2021-06-05 04:23:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:32,262 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:32,262 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:32,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable335 [2021-06-05 04:23:32,463 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 365715660, now seen corresponding path program 47 times [2021-06-05 04:23:32,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:32,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228169256] [2021-06-05 04:23:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:32,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:32,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228169256] [2021-06-05 04:23:32,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228169256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:32,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790247351] [2021-06-05 04:23:32,495 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:32,517 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:32,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:32,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:32,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:32,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790247351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:32,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:32,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:32,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60510288] [2021-06-05 04:23:32,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:32,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:32,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:32,580 INFO L87 Difference]: Start difference. First operand 134 states and 419 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:32,684 INFO L93 Difference]: Finished difference Result 228 states and 642 transitions. [2021-06-05 04:23:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:32,685 INFO L225 Difference]: With dead ends: 228 [2021-06-05 04:23:32,685 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 04:23:32,685 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 04:23:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 143. [2021-06-05 04:23:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.1619718309859155) internal successors, (449), 142 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 449 transitions. [2021-06-05 04:23:32,687 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 449 transitions. Word has length 16 [2021-06-05 04:23:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:32,687 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 449 transitions. [2021-06-05 04:23:32,687 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 449 transitions. [2021-06-05 04:23:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:32,688 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:32,688 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:32,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336,109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:32,888 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:32,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1794670766, now seen corresponding path program 48 times [2021-06-05 04:23:32,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:32,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077639105] [2021-06-05 04:23:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:32,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:32,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077639105] [2021-06-05 04:23:32,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077639105] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:32,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222908040] [2021-06-05 04:23:32,928 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:32,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:32,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:32,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:32,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:33,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222908040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:33,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:33,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:33,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681537820] [2021-06-05 04:23:33,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:33,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:33,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:33,009 INFO L87 Difference]: Start difference. First operand 143 states and 449 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:33,145 INFO L93 Difference]: Finished difference Result 204 states and 583 transitions. [2021-06-05 04:23:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:33,146 INFO L225 Difference]: With dead ends: 204 [2021-06-05 04:23:33,146 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 04:23:33,146 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 121.3ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:23:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 04:23:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 146. [2021-06-05 04:23:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.117241379310345) internal successors, (452), 145 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 452 transitions. [2021-06-05 04:23:33,148 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 452 transitions. Word has length 16 [2021-06-05 04:23:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:33,148 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 452 transitions. [2021-06-05 04:23:33,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 452 transitions. [2021-06-05 04:23:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:33,148 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:33,148 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:33,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable339 [2021-06-05 04:23:33,349 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1574273086, now seen corresponding path program 48 times [2021-06-05 04:23:33,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:33,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415322921] [2021-06-05 04:23:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:33,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:33,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415322921] [2021-06-05 04:23:33,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415322921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:33,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113381534] [2021-06-05 04:23:33,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:33,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:33,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:33,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:33,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:33,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113381534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:33,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:33,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:33,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784532720] [2021-06-05 04:23:33,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:33,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:33,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:33,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:33,498 INFO L87 Difference]: Start difference. First operand 146 states and 452 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:33,614 INFO L93 Difference]: Finished difference Result 237 states and 668 transitions. [2021-06-05 04:23:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:33,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:33,615 INFO L225 Difference]: With dead ends: 237 [2021-06-05 04:23:33,615 INFO L226 Difference]: Without dead ends: 237 [2021-06-05 04:23:33,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 87.3ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-06-05 04:23:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 143. [2021-06-05 04:23:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 04:23:33,618 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 04:23:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:33,618 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 04:23:33,618 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 04:23:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:33,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:33,619 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:33,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable342 [2021-06-05 04:23:33,838 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -486737002, now seen corresponding path program 49 times [2021-06-05 04:23:33,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:33,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135340430] [2021-06-05 04:23:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:33,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:33,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135340430] [2021-06-05 04:23:33,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135340430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:33,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755944648] [2021-06-05 04:23:33,870 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:33,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:33,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:33,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755944648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:33,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:33,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:33,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094651776] [2021-06-05 04:23:33,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:33,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:33,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:33,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:33,954 INFO L87 Difference]: Start difference. First operand 143 states and 443 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:34,026 INFO L93 Difference]: Finished difference Result 241 states and 680 transitions. [2021-06-05 04:23:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:34,026 INFO L225 Difference]: With dead ends: 241 [2021-06-05 04:23:34,026 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 04:23:34,027 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 04:23:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2021-06-05 04:23:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1319444444444446) internal successors, (451), 144 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 451 transitions. [2021-06-05 04:23:34,029 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 451 transitions. Word has length 16 [2021-06-05 04:23:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:34,029 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 451 transitions. [2021-06-05 04:23:34,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 451 transitions. [2021-06-05 04:23:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:34,030 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:34,030 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:34,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable343 [2021-06-05 04:23:34,242 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1484976352, now seen corresponding path program 50 times [2021-06-05 04:23:34,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:34,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718545969] [2021-06-05 04:23:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:34,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:34,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718545969] [2021-06-05 04:23:34,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718545969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:34,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755377703] [2021-06-05 04:23:34,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:34,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:34,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:34,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:34,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:34,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755377703] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:34,348 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:34,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:34,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022743130] [2021-06-05 04:23:34,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:34,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:34,349 INFO L87 Difference]: Start difference. First operand 145 states and 451 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:34,427 INFO L93 Difference]: Finished difference Result 219 states and 626 transitions. [2021-06-05 04:23:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:34,428 INFO L225 Difference]: With dead ends: 219 [2021-06-05 04:23:34,428 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 04:23:34,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 65.6ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 04:23:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2021-06-05 04:23:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 04:23:34,435 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 04:23:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:34,435 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 04:23:34,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 04:23:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:34,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:34,435 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:34,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable344 [2021-06-05 04:23:34,636 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash -375718014, now seen corresponding path program 49 times [2021-06-05 04:23:34,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:34,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754002151] [2021-06-05 04:23:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:34,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:34,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754002151] [2021-06-05 04:23:34,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754002151] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:34,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:34,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:34,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857620030] [2021-06-05 04:23:34,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:34,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:34,663 INFO L87 Difference]: Start difference. First operand 143 states and 443 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:34,730 INFO L93 Difference]: Finished difference Result 252 states and 683 transitions. [2021-06-05 04:23:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:34,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:34,731 INFO L225 Difference]: With dead ends: 252 [2021-06-05 04:23:34,731 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 04:23:34,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 04:23:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 145. [2021-06-05 04:23:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 04:23:34,733 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 04:23:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:34,733 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 04:23:34,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 04:23:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:34,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:34,733 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:34,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2021-06-05 04:23:34,733 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -449090494, now seen corresponding path program 50 times [2021-06-05 04:23:34,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:34,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803629260] [2021-06-05 04:23:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:34,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:34,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803629260] [2021-06-05 04:23:34,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803629260] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:34,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:34,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:34,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273201727] [2021-06-05 04:23:34,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:34,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:34,771 INFO L87 Difference]: Start difference. First operand 145 states and 447 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:34,848 INFO L93 Difference]: Finished difference Result 235 states and 657 transitions. [2021-06-05 04:23:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:34,849 INFO L225 Difference]: With dead ends: 235 [2021-06-05 04:23:34,849 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 04:23:34,849 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 04:23:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2021-06-05 04:23:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.104895104895105) internal successors, (444), 143 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 444 transitions. [2021-06-05 04:23:34,852 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 444 transitions. Word has length 16 [2021-06-05 04:23:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:34,852 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 444 transitions. [2021-06-05 04:23:34,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 444 transitions. [2021-06-05 04:23:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:34,852 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:34,853 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:34,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2021-06-05 04:23:34,853 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1114797280, now seen corresponding path program 51 times [2021-06-05 04:23:34,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:34,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106029146] [2021-06-05 04:23:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:34,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:34,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106029146] [2021-06-05 04:23:34,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106029146] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:34,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:34,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:34,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366832712] [2021-06-05 04:23:34,882 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:34,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:34,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:34,882 INFO L87 Difference]: Start difference. First operand 144 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:34,990 INFO L93 Difference]: Finished difference Result 221 states and 606 transitions. [2021-06-05 04:23:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:34,991 INFO L225 Difference]: With dead ends: 221 [2021-06-05 04:23:34,991 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 04:23:34,991 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 04:23:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 146. [2021-06-05 04:23:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.089655172413793) internal successors, (448), 145 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 448 transitions. [2021-06-05 04:23:34,993 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 448 transitions. Word has length 16 [2021-06-05 04:23:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:34,993 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 448 transitions. [2021-06-05 04:23:34,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 448 transitions. [2021-06-05 04:23:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:34,994 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:34,994 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:34,994 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2021-06-05 04:23:34,994 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2082842440, now seen corresponding path program 52 times [2021-06-05 04:23:34,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:34,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710836497] [2021-06-05 04:23:34,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:35,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710836497] [2021-06-05 04:23:35,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710836497] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:35,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:35,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:35,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001420783] [2021-06-05 04:23:35,027 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:35,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:35,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:35,028 INFO L87 Difference]: Start difference. First operand 146 states and 448 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:35,140 INFO L93 Difference]: Finished difference Result 207 states and 585 transitions. [2021-06-05 04:23:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:35,140 INFO L225 Difference]: With dead ends: 207 [2021-06-05 04:23:35,141 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 04:23:35,141 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 04:23:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 145. [2021-06-05 04:23:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0902777777777777) internal successors, (445), 144 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 445 transitions. [2021-06-05 04:23:35,143 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 445 transitions. Word has length 16 [2021-06-05 04:23:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:35,143 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 445 transitions. [2021-06-05 04:23:35,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 445 transitions. [2021-06-05 04:23:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:35,144 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:35,144 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:35,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2021-06-05 04:23:35,144 INFO L430 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1272791022, now seen corresponding path program 51 times [2021-06-05 04:23:35,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:35,144 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880980743] [2021-06-05 04:23:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:35,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880980743] [2021-06-05 04:23:35,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880980743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:35,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951717852] [2021-06-05 04:23:35,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:35,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:23:35,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:35,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:35,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951717852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:35,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:35,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:35,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947207602] [2021-06-05 04:23:35,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:35,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:35,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:35,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:35,293 INFO L87 Difference]: Start difference. First operand 145 states and 445 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:35,407 INFO L93 Difference]: Finished difference Result 271 states and 747 transitions. [2021-06-05 04:23:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:35,407 INFO L225 Difference]: With dead ends: 271 [2021-06-05 04:23:35,408 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 04:23:35,408 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 04:23:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 147. [2021-06-05 04:23:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.1027397260273974) internal successors, (453), 146 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 453 transitions. [2021-06-05 04:23:35,410 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 453 transitions. Word has length 16 [2021-06-05 04:23:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:35,410 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 453 transitions. [2021-06-05 04:23:35,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 453 transitions. [2021-06-05 04:23:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:35,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:35,411 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:35,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351,114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:35,617 INFO L430 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:35,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:35,617 INFO L82 PathProgramCache]: Analyzing trace with hash 88765084, now seen corresponding path program 52 times [2021-06-05 04:23:35,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:35,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534189556] [2021-06-05 04:23:35,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:35,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534189556] [2021-06-05 04:23:35,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534189556] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:35,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:35,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:35,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376451478] [2021-06-05 04:23:35,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:35,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:35,648 INFO L87 Difference]: Start difference. First operand 147 states and 453 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:35,725 INFO L93 Difference]: Finished difference Result 245 states and 683 transitions. [2021-06-05 04:23:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:35,726 INFO L225 Difference]: With dead ends: 245 [2021-06-05 04:23:35,726 INFO L226 Difference]: Without dead ends: 243 [2021-06-05 04:23:35,726 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.4ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-06-05 04:23:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 144. [2021-06-05 04:23:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.090909090909091) internal successors, (442), 143 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 442 transitions. [2021-06-05 04:23:35,729 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 442 transitions. Word has length 16 [2021-06-05 04:23:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:35,729 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 442 transitions. [2021-06-05 04:23:35,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 442 transitions. [2021-06-05 04:23:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:35,730 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:35,730 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:35,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2021-06-05 04:23:35,730 INFO L430 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1701446174, now seen corresponding path program 53 times [2021-06-05 04:23:35,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:35,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209919555] [2021-06-05 04:23:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:35,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209919555] [2021-06-05 04:23:35,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209919555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:35,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848298036] [2021-06-05 04:23:35,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:35,797 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:23:35,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:35,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:35,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:35,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848298036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:35,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:35,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:35,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702654371] [2021-06-05 04:23:35,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:35,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:35,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:35,859 INFO L87 Difference]: Start difference. First operand 144 states and 442 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:35,963 INFO L93 Difference]: Finished difference Result 215 states and 605 transitions. [2021-06-05 04:23:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:35,964 INFO L225 Difference]: With dead ends: 215 [2021-06-05 04:23:35,964 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 04:23:35,964 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.8ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 04:23:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2021-06-05 04:23:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0492957746478875) internal successors, (433), 142 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 433 transitions. [2021-06-05 04:23:35,967 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 433 transitions. Word has length 16 [2021-06-05 04:23:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:35,967 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 433 transitions. [2021-06-05 04:23:35,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 433 transitions. [2021-06-05 04:23:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:35,967 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:35,967 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:36,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:36,181 INFO L430 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:36,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash -621807768, now seen corresponding path program 54 times [2021-06-05 04:23:36,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:36,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101782608] [2021-06-05 04:23:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:36,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:36,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101782608] [2021-06-05 04:23:36,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101782608] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:36,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17649491] [2021-06-05 04:23:36,211 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:36,240 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:36,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:36,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:36,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:36,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17649491] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:36,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:36,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:36,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408452564] [2021-06-05 04:23:36,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:36,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:36,297 INFO L87 Difference]: Start difference. First operand 143 states and 433 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:36,386 INFO L93 Difference]: Finished difference Result 206 states and 578 transitions. [2021-06-05 04:23:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:36,387 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:36,387 INFO L225 Difference]: With dead ends: 206 [2021-06-05 04:23:36,387 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 04:23:36,387 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 04:23:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 137. [2021-06-05 04:23:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0661764705882355) internal successors, (417), 136 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 417 transitions. [2021-06-05 04:23:36,389 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 417 transitions. Word has length 16 [2021-06-05 04:23:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:36,389 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 417 transitions. [2021-06-05 04:23:36,389 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 417 transitions. [2021-06-05 04:23:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:36,390 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:36,390 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:36,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable354 [2021-06-05 04:23:36,605 INFO L430 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -239087380, now seen corresponding path program 55 times [2021-06-05 04:23:36,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:36,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72377676] [2021-06-05 04:23:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:36,634 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:36,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72377676] [2021-06-05 04:23:36,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72377676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:36,634 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129918506] [2021-06-05 04:23:36,634 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:36,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:36,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:36,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129918506] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:36,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:36,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:36,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771015830] [2021-06-05 04:23:36,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:36,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:36,703 INFO L87 Difference]: Start difference. First operand 137 states and 417 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:36,770 INFO L93 Difference]: Finished difference Result 185 states and 529 transitions. [2021-06-05 04:23:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:36,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:36,771 INFO L225 Difference]: With dead ends: 185 [2021-06-05 04:23:36,771 INFO L226 Difference]: Without dead ends: 181 [2021-06-05 04:23:36,771 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-06-05 04:23:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2021-06-05 04:23:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0522388059701493) internal successors, (409), 134 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 409 transitions. [2021-06-05 04:23:36,773 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 409 transitions. Word has length 16 [2021-06-05 04:23:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:36,773 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 409 transitions. [2021-06-05 04:23:36,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 409 transitions. [2021-06-05 04:23:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:36,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:36,773 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:36,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:36,974 INFO L430 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash 212027308, now seen corresponding path program 53 times [2021-06-05 04:23:36,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:36,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630896249] [2021-06-05 04:23:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630896249] [2021-06-05 04:23:37,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630896249] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466227714] [2021-06-05 04:23:37,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,015 INFO L87 Difference]: Start difference. First operand 135 states and 409 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,077 INFO L93 Difference]: Finished difference Result 213 states and 580 transitions. [2021-06-05 04:23:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,077 INFO L225 Difference]: With dead ends: 213 [2021-06-05 04:23:37,077 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 04:23:37,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 04:23:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2021-06-05 04:23:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.028985507246377) internal successors, (418), 138 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 418 transitions. [2021-06-05 04:23:37,079 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 418 transitions. Word has length 16 [2021-06-05 04:23:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,080 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 418 transitions. [2021-06-05 04:23:37,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 418 transitions. [2021-06-05 04:23:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,080 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2021-06-05 04:23:37,080 INFO L430 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 138654828, now seen corresponding path program 54 times [2021-06-05 04:23:37,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215787617] [2021-06-05 04:23:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215787617] [2021-06-05 04:23:37,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215787617] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845808035] [2021-06-05 04:23:37,105 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,106 INFO L87 Difference]: Start difference. First operand 139 states and 418 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,172 INFO L93 Difference]: Finished difference Result 211 states and 577 transitions. [2021-06-05 04:23:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,172 INFO L225 Difference]: With dead ends: 211 [2021-06-05 04:23:37,172 INFO L226 Difference]: Without dead ends: 208 [2021-06-05 04:23:37,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-06-05 04:23:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 137. [2021-06-05 04:23:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.036764705882353) internal successors, (413), 136 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 413 transitions. [2021-06-05 04:23:37,174 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 413 transitions. Word has length 16 [2021-06-05 04:23:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,174 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 413 transitions. [2021-06-05 04:23:37,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 413 transitions. [2021-06-05 04:23:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,175 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,175 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-06-05 04:23:37,175 INFO L430 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 141280604, now seen corresponding path program 55 times [2021-06-05 04:23:37,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241431557] [2021-06-05 04:23:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241431557] [2021-06-05 04:23:37,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241431557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546134150] [2021-06-05 04:23:37,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,208 INFO L87 Difference]: Start difference. First operand 137 states and 413 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,269 INFO L93 Difference]: Finished difference Result 199 states and 559 transitions. [2021-06-05 04:23:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,270 INFO L225 Difference]: With dead ends: 199 [2021-06-05 04:23:37,270 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 04:23:37,270 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 04:23:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2021-06-05 04:23:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.037037037037037) internal successors, (410), 135 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 410 transitions. [2021-06-05 04:23:37,272 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 410 transitions. Word has length 16 [2021-06-05 04:23:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,272 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 410 transitions. [2021-06-05 04:23:37,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 410 transitions. [2021-06-05 04:23:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,272 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,272 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2021-06-05 04:23:37,272 INFO L430 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash 567039630, now seen corresponding path program 56 times [2021-06-05 04:23:37,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029323141] [2021-06-05 04:23:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029323141] [2021-06-05 04:23:37,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029323141] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825360215] [2021-06-05 04:23:37,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,310 INFO L87 Difference]: Start difference. First operand 136 states and 410 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,400 INFO L93 Difference]: Finished difference Result 169 states and 478 transitions. [2021-06-05 04:23:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,401 INFO L225 Difference]: With dead ends: 169 [2021-06-05 04:23:37,401 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 04:23:37,401 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 04:23:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2021-06-05 04:23:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.992957746478873) internal successors, (425), 142 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 425 transitions. [2021-06-05 04:23:37,402 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 425 transitions. Word has length 16 [2021-06-05 04:23:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,402 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 425 transitions. [2021-06-05 04:23:37,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 425 transitions. [2021-06-05 04:23:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,403 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,403 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2021-06-05 04:23:37,403 INFO L430 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,403 INFO L82 PathProgramCache]: Analyzing trace with hash -530287946, now seen corresponding path program 57 times [2021-06-05 04:23:37,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978450925] [2021-06-05 04:23:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978450925] [2021-06-05 04:23:37,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978450925] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987864577] [2021-06-05 04:23:37,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,428 INFO L87 Difference]: Start difference. First operand 143 states and 425 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,522 INFO L93 Difference]: Finished difference Result 168 states and 476 transitions. [2021-06-05 04:23:37,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,523 INFO L225 Difference]: With dead ends: 168 [2021-06-05 04:23:37,523 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 04:23:37,523 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 04:23:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2021-06-05 04:23:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.99290780141844) internal successors, (422), 141 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 422 transitions. [2021-06-05 04:23:37,525 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 422 transitions. Word has length 16 [2021-06-05 04:23:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,525 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 422 transitions. [2021-06-05 04:23:37,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 422 transitions. [2021-06-05 04:23:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,525 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,525 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2021-06-05 04:23:37,525 INFO L430 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1618508590, now seen corresponding path program 58 times [2021-06-05 04:23:37,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29440861] [2021-06-05 04:23:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29440861] [2021-06-05 04:23:37,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29440861] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:37,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:37,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:37,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068469712] [2021-06-05 04:23:37,548 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:37,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:37,548 INFO L87 Difference]: Start difference. First operand 142 states and 422 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,632 INFO L93 Difference]: Finished difference Result 155 states and 456 transitions. [2021-06-05 04:23:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,632 INFO L225 Difference]: With dead ends: 155 [2021-06-05 04:23:37,632 INFO L226 Difference]: Without dead ends: 150 [2021-06-05 04:23:37,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-06-05 04:23:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2021-06-05 04:23:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0296296296296297) internal successors, (409), 135 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 409 transitions. [2021-06-05 04:23:37,634 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 409 transitions. Word has length 16 [2021-06-05 04:23:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,634 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 409 transitions. [2021-06-05 04:23:37,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 409 transitions. [2021-06-05 04:23:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,635 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,635 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:37,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2021-06-05 04:23:37,635 INFO L430 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1191391966, now seen corresponding path program 56 times [2021-06-05 04:23:37,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:37,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382399132] [2021-06-05 04:23:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:37,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382399132] [2021-06-05 04:23:37,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382399132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:37,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103768374] [2021-06-05 04:23:37,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:37,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:37,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:37,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:37,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:37,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103768374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:37,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:37,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:37,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126868324] [2021-06-05 04:23:37,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:37,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:37,746 INFO L87 Difference]: Start difference. First operand 136 states and 409 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:37,825 INFO L93 Difference]: Finished difference Result 201 states and 566 transitions. [2021-06-05 04:23:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:37,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:37,825 INFO L225 Difference]: With dead ends: 201 [2021-06-05 04:23:37,825 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 04:23:37,825 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 04:23:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 04:23:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.985074626865672) internal successors, (400), 134 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 400 transitions. [2021-06-05 04:23:37,827 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 400 transitions. Word has length 16 [2021-06-05 04:23:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:37,827 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 400 transitions. [2021-06-05 04:23:37,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 400 transitions. [2021-06-05 04:23:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:37,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:37,828 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:38,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable366 [2021-06-05 04:23:38,028 INFO L430 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash 170164140, now seen corresponding path program 57 times [2021-06-05 04:23:38,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:38,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547815729] [2021-06-05 04:23:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:38,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547815729] [2021-06-05 04:23:38,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547815729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:38,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:38,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:38,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94681441] [2021-06-05 04:23:38,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:38,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:38,065 INFO L87 Difference]: Start difference. First operand 135 states and 400 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:38,132 INFO L93 Difference]: Finished difference Result 197 states and 549 transitions. [2021-06-05 04:23:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:38,133 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:38,133 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 04:23:38,133 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 04:23:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 133. [2021-06-05 04:23:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9696969696969697) internal successors, (392), 132 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 392 transitions. [2021-06-05 04:23:38,135 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 392 transitions. Word has length 16 [2021-06-05 04:23:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:38,135 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 392 transitions. [2021-06-05 04:23:38,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 392 transitions. [2021-06-05 04:23:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:38,135 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:38,135 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:38,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2021-06-05 04:23:38,135 INFO L430 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash -365065662, now seen corresponding path program 58 times [2021-06-05 04:23:38,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:38,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21030834] [2021-06-05 04:23:38,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:38,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21030834] [2021-06-05 04:23:38,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21030834] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:38,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:38,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:38,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675196650] [2021-06-05 04:23:38,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:38,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:38,161 INFO L87 Difference]: Start difference. First operand 133 states and 392 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:38,219 INFO L93 Difference]: Finished difference Result 174 states and 499 transitions. [2021-06-05 04:23:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:38,220 INFO L225 Difference]: With dead ends: 174 [2021-06-05 04:23:38,220 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 04:23:38,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 04:23:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2021-06-05 04:23:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.008) internal successors, (376), 125 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 376 transitions. [2021-06-05 04:23:38,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 376 transitions. Word has length 16 [2021-06-05 04:23:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:38,222 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 376 transitions. [2021-06-05 04:23:38,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 376 transitions. [2021-06-05 04:23:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:38,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:38,222 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:38,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2021-06-05 04:23:38,222 INFO L430 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash -559894012, now seen corresponding path program 59 times [2021-06-05 04:23:38,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:38,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079097251] [2021-06-05 04:23:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:38,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079097251] [2021-06-05 04:23:38,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079097251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:38,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654865583] [2021-06-05 04:23:38,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:38,279 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:38,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:38,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:38,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654865583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:38,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:38,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:38,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518984522] [2021-06-05 04:23:38,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:38,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:38,334 INFO L87 Difference]: Start difference. First operand 126 states and 376 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:38,409 INFO L93 Difference]: Finished difference Result 200 states and 564 transitions. [2021-06-05 04:23:38,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:38,410 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:38,410 INFO L225 Difference]: With dead ends: 200 [2021-06-05 04:23:38,410 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 04:23:38,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 04:23:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 129. [2021-06-05 04:23:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0546875) internal successors, (391), 128 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 391 transitions. [2021-06-05 04:23:38,412 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 391 transitions. Word has length 16 [2021-06-05 04:23:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:38,412 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 391 transitions. [2021-06-05 04:23:38,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 391 transitions. [2021-06-05 04:23:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:38,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:38,412 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:38,613 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 04:23:38,613 INFO L430 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 635142162, now seen corresponding path program 59 times [2021-06-05 04:23:38,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:38,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242320325] [2021-06-05 04:23:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:38,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242320325] [2021-06-05 04:23:38,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242320325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:38,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369389533] [2021-06-05 04:23:38,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:38,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:38,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:38,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:38,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:38,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369389533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:38,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:38,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:38,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754641094] [2021-06-05 04:23:38,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:38,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:38,703 INFO L87 Difference]: Start difference. First operand 129 states and 391 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:38,775 INFO L93 Difference]: Finished difference Result 199 states and 565 transitions. [2021-06-05 04:23:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:38,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:38,776 INFO L225 Difference]: With dead ends: 199 [2021-06-05 04:23:38,776 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 04:23:38,776 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 04:23:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 136. [2021-06-05 04:23:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0444444444444443) internal successors, (411), 135 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 411 transitions. [2021-06-05 04:23:38,778 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 411 transitions. Word has length 16 [2021-06-05 04:23:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:38,778 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 411 transitions. [2021-06-05 04:23:38,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 411 transitions. [2021-06-05 04:23:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:38,778 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:38,778 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:38,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:38,979 INFO L430 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2064097268, now seen corresponding path program 60 times [2021-06-05 04:23:38,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:38,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841389740] [2021-06-05 04:23:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:39,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841389740] [2021-06-05 04:23:39,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841389740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617498750] [2021-06-05 04:23:39,014 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:39,038 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:39,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:39,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:39,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617498750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:39,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:39,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738533633] [2021-06-05 04:23:39,098 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:39,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:39,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:39,098 INFO L87 Difference]: Start difference. First operand 136 states and 411 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:39,171 INFO L93 Difference]: Finished difference Result 206 states and 579 transitions. [2021-06-05 04:23:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:39,172 INFO L225 Difference]: With dead ends: 206 [2021-06-05 04:23:39,172 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 04:23:39,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 04:23:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2021-06-05 04:23:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.022222222222222) internal successors, (408), 135 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 408 transitions. [2021-06-05 04:23:39,174 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 408 transitions. Word has length 16 [2021-06-05 04:23:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:39,174 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 408 transitions. [2021-06-05 04:23:39,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 408 transitions. [2021-06-05 04:23:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:39,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:39,174 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:39,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:39,389 INFO L430 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1304846584, now seen corresponding path program 60 times [2021-06-05 04:23:39,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:39,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997456099] [2021-06-05 04:23:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:39,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997456099] [2021-06-05 04:23:39,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997456099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032851245] [2021-06-05 04:23:39,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:39,441 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:39,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:39,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:39,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032851245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:39,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:39,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140346994] [2021-06-05 04:23:39,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:39,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:39,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:39,481 INFO L87 Difference]: Start difference. First operand 136 states and 408 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:39,559 INFO L93 Difference]: Finished difference Result 201 states and 573 transitions. [2021-06-05 04:23:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:39,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:39,560 INFO L225 Difference]: With dead ends: 201 [2021-06-05 04:23:39,560 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 04:23:39,560 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 04:23:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2021-06-05 04:23:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.022727272727273) internal successors, (399), 132 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 399 transitions. [2021-06-05 04:23:39,562 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 399 transitions. Word has length 16 [2021-06-05 04:23:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:39,562 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 399 transitions. [2021-06-05 04:23:39,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 399 transitions. [2021-06-05 04:23:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:39,562 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:39,562 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:39,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable376 [2021-06-05 04:23:39,763 INFO L430 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1190356588, now seen corresponding path program 61 times [2021-06-05 04:23:39,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:39,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031364425] [2021-06-05 04:23:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:39,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031364425] [2021-06-05 04:23:39,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031364425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104807827] [2021-06-05 04:23:39,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:39,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:39,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:39,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104807827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:39,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:39,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:39,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439435941] [2021-06-05 04:23:39,874 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:39,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:39,875 INFO L87 Difference]: Start difference. First operand 133 states and 399 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:39,949 INFO L93 Difference]: Finished difference Result 199 states and 553 transitions. [2021-06-05 04:23:39,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:39,950 INFO L225 Difference]: With dead ends: 199 [2021-06-05 04:23:39,950 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 04:23:39,950 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:39,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 04:23:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 133. [2021-06-05 04:23:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.0) internal successors, (396), 132 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 396 transitions. [2021-06-05 04:23:39,951 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 396 transitions. Word has length 16 [2021-06-05 04:23:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:39,952 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 396 transitions. [2021-06-05 04:23:39,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 396 transitions. [2021-06-05 04:23:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:39,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:39,952 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:40,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:40,152 INFO L430 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1323280610, now seen corresponding path program 61 times [2021-06-05 04:23:40,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:40,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368870888] [2021-06-05 04:23:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:40,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:40,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368870888] [2021-06-05 04:23:40,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368870888] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:40,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835642393] [2021-06-05 04:23:40,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:40,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:40,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:40,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835642393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:40,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:40,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:40,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588578628] [2021-06-05 04:23:40,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:40,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:40,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:40,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:40,244 INFO L87 Difference]: Start difference. First operand 133 states and 396 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:40,317 INFO L93 Difference]: Finished difference Result 220 states and 636 transitions. [2021-06-05 04:23:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:40,318 INFO L225 Difference]: With dead ends: 220 [2021-06-05 04:23:40,318 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 04:23:40,318 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 53.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 04:23:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 130. [2021-06-05 04:23:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 3.0) internal successors, (387), 129 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 387 transitions. [2021-06-05 04:23:40,320 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 387 transitions. Word has length 16 [2021-06-05 04:23:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:40,320 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 387 transitions. [2021-06-05 04:23:40,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 387 transitions. [2021-06-05 04:23:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:40,320 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:40,320 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:40,521 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380,124 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:40,521 INFO L430 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:40,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash 715054666, now seen corresponding path program 62 times [2021-06-05 04:23:40,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:40,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61767172] [2021-06-05 04:23:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:40,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:40,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61767172] [2021-06-05 04:23:40,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61767172] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:40,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971073771] [2021-06-05 04:23:40,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:40,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:40,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:40,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:40,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:40,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971073771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:40,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:40,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:40,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83529083] [2021-06-05 04:23:40,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:40,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:40,655 INFO L87 Difference]: Start difference. First operand 130 states and 387 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:40,820 INFO L93 Difference]: Finished difference Result 267 states and 740 transitions. [2021-06-05 04:23:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:40,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:40,820 INFO L225 Difference]: With dead ends: 267 [2021-06-05 04:23:40,820 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 04:23:40,821 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 141.8ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 04:23:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 138. [2021-06-05 04:23:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.116788321167883) internal successors, (427), 137 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 427 transitions. [2021-06-05 04:23:40,823 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 427 transitions. Word has length 16 [2021-06-05 04:23:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:40,823 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 427 transitions. [2021-06-05 04:23:40,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 427 transitions. [2021-06-05 04:23:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:40,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:40,823 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:41,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381,125 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:41,024 INFO L430 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1910090840, now seen corresponding path program 62 times [2021-06-05 04:23:41,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:41,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113042489] [2021-06-05 04:23:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:41,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:41,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113042489] [2021-06-05 04:23:41,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113042489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:41,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900066950] [2021-06-05 04:23:41,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:41,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:41,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:41,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:41,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:41,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900066950] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:41,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:41,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:41,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445645567] [2021-06-05 04:23:41,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:41,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:41,152 INFO L87 Difference]: Start difference. First operand 138 states and 427 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:41,312 INFO L93 Difference]: Finished difference Result 271 states and 760 transitions. [2021-06-05 04:23:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:41,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:41,313 INFO L225 Difference]: With dead ends: 271 [2021-06-05 04:23:41,313 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 04:23:41,313 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 134.9ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 04:23:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 142. [2021-06-05 04:23:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.148936170212766) internal successors, (444), 141 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 444 transitions. [2021-06-05 04:23:41,316 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 444 transitions. Word has length 16 [2021-06-05 04:23:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:41,316 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 444 transitions. [2021-06-05 04:23:41,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 444 transitions. [2021-06-05 04:23:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:41,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:41,317 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:41,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382,126 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:41,517 INFO L430 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -955921350, now seen corresponding path program 63 times [2021-06-05 04:23:41,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:41,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738459123] [2021-06-05 04:23:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:41,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:41,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738459123] [2021-06-05 04:23:41,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738459123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:41,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030213242] [2021-06-05 04:23:41,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:41,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:41,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:41,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:41,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:41,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030213242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:41,657 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:41,657 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:41,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355680002] [2021-06-05 04:23:41,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:41,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:41,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:41,657 INFO L87 Difference]: Start difference. First operand 142 states and 444 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:41,806 INFO L93 Difference]: Finished difference Result 260 states and 717 transitions. [2021-06-05 04:23:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:41,807 INFO L225 Difference]: With dead ends: 260 [2021-06-05 04:23:41,807 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 04:23:41,807 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 135.4ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 04:23:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 145. [2021-06-05 04:23:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 04:23:41,809 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 04:23:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:41,809 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 04:23:41,809 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 04:23:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:41,810 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:41,810 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:42,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:42,010 INFO L430 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -29897906, now seen corresponding path program 63 times [2021-06-05 04:23:42,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:42,011 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232199642] [2021-06-05 04:23:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:42,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:42,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232199642] [2021-06-05 04:23:42,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232199642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:42,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563467968] [2021-06-05 04:23:42,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:42,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:23:42,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:42,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:42,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:42,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563467968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:42,146 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:42,146 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:42,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273361853] [2021-06-05 04:23:42,146 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:42,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:42,146 INFO L87 Difference]: Start difference. First operand 145 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:42,327 INFO L93 Difference]: Finished difference Result 278 states and 788 transitions. [2021-06-05 04:23:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:42,328 INFO L225 Difference]: With dead ends: 278 [2021-06-05 04:23:42,328 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 04:23:42,328 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:23:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 04:23:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 139. [2021-06-05 04:23:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0652173913043477) internal successors, (423), 138 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 423 transitions. [2021-06-05 04:23:42,330 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 423 transitions. Word has length 16 [2021-06-05 04:23:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:42,330 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 423 transitions. [2021-06-05 04:23:42,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 423 transitions. [2021-06-05 04:23:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:42,331 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:42,331 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:42,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable388 [2021-06-05 04:23:42,531 INFO L430 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1057638178, now seen corresponding path program 64 times [2021-06-05 04:23:42,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:42,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015915671] [2021-06-05 04:23:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:42,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:42,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015915671] [2021-06-05 04:23:42,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015915671] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:42,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579684792] [2021-06-05 04:23:42,562 INFO L93 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:42,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:23:42,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:42,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:42,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579684792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:42,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:42,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:42,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177057108] [2021-06-05 04:23:42,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:42,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:42,685 INFO L87 Difference]: Start difference. First operand 139 states and 423 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:42,778 INFO L93 Difference]: Finished difference Result 239 states and 660 transitions. [2021-06-05 04:23:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:42,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:42,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:42,779 INFO L225 Difference]: With dead ends: 239 [2021-06-05 04:23:42,779 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 04:23:42,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 74.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 04:23:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 134. [2021-06-05 04:23:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.045112781954887) internal successors, (405), 133 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 405 transitions. [2021-06-05 04:23:42,781 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 405 transitions. Word has length 16 [2021-06-05 04:23:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:42,781 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 405 transitions. [2021-06-05 04:23:42,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 405 transitions. [2021-06-05 04:23:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:42,781 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:42,781 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:42,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable389 [2021-06-05 04:23:42,982 INFO L430 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1265615764, now seen corresponding path program 65 times [2021-06-05 04:23:42,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:42,982 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925473817] [2021-06-05 04:23:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925473817] [2021-06-05 04:23:43,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925473817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:43,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095522962] [2021-06-05 04:23:43,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:43,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:43,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:43,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:43,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095522962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:43,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:43,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:43,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775201052] [2021-06-05 04:23:43,088 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:43,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:43,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:43,088 INFO L87 Difference]: Start difference. First operand 134 states and 405 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,161 INFO L93 Difference]: Finished difference Result 217 states and 606 transitions. [2021-06-05 04:23:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,162 INFO L225 Difference]: With dead ends: 217 [2021-06-05 04:23:43,162 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 04:23:43,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 04:23:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 04:23:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.030534351145038) internal successors, (397), 131 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 397 transitions. [2021-06-05 04:23:43,164 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 397 transitions. Word has length 16 [2021-06-05 04:23:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,164 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 397 transitions. [2021-06-05 04:23:43,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 397 transitions. [2021-06-05 04:23:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,164 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:43,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:43,365 INFO L430 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1168657166, now seen corresponding path program 64 times [2021-06-05 04:23:43,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:43,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582390427] [2021-06-05 04:23:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,389 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582390427] [2021-06-05 04:23:43,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582390427] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:43,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:43,390 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:43,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922137761] [2021-06-05 04:23:43,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:43,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:43,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:43,390 INFO L87 Difference]: Start difference. First operand 132 states and 397 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,458 INFO L93 Difference]: Finished difference Result 227 states and 624 transitions. [2021-06-05 04:23:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,459 INFO L225 Difference]: With dead ends: 227 [2021-06-05 04:23:43,459 INFO L226 Difference]: Without dead ends: 223 [2021-06-05 04:23:43,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-06-05 04:23:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 134. [2021-06-05 04:23:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0150375939849625) internal successors, (401), 133 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 401 transitions. [2021-06-05 04:23:43,461 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 401 transitions. Word has length 16 [2021-06-05 04:23:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,461 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 401 transitions. [2021-06-05 04:23:43,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 401 transitions. [2021-06-05 04:23:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,461 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,461 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:43,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2021-06-05 04:23:43,462 INFO L430 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1095284686, now seen corresponding path program 65 times [2021-06-05 04:23:43,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:43,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394261629] [2021-06-05 04:23:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394261629] [2021-06-05 04:23:43,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394261629] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:43,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:43,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:43,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138229150] [2021-06-05 04:23:43,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:43,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:43,486 INFO L87 Difference]: Start difference. First operand 134 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,553 INFO L93 Difference]: Finished difference Result 210 states and 598 transitions. [2021-06-05 04:23:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,554 INFO L225 Difference]: With dead ends: 210 [2021-06-05 04:23:43,554 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 04:23:43,554 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 04:23:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-06-05 04:23:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.015151515151515) internal successors, (398), 132 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 398 transitions. [2021-06-05 04:23:43,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 398 transitions. Word has length 16 [2021-06-05 04:23:43,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,556 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 398 transitions. [2021-06-05 04:23:43,557 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 398 transitions. [2021-06-05 04:23:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,557 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,557 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:43,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2021-06-05 04:23:43,557 INFO L430 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash 429577900, now seen corresponding path program 66 times [2021-06-05 04:23:43,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:43,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032829271] [2021-06-05 04:23:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032829271] [2021-06-05 04:23:43,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032829271] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:43,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:43,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:43,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885743258] [2021-06-05 04:23:43,588 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:43,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:43,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:43,589 INFO L87 Difference]: Start difference. First operand 133 states and 398 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,661 INFO L93 Difference]: Finished difference Result 227 states and 615 transitions. [2021-06-05 04:23:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,661 INFO L225 Difference]: With dead ends: 227 [2021-06-05 04:23:43,661 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 04:23:43,662 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 04:23:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2021-06-05 04:23:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.978102189781022) internal successors, (408), 137 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 408 transitions. [2021-06-05 04:23:43,664 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 408 transitions. Word has length 16 [2021-06-05 04:23:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,664 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 408 transitions. [2021-06-05 04:23:43,664 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 408 transitions. [2021-06-05 04:23:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,664 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,664 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:43,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-06-05 04:23:43,665 INFO L430 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash -667749676, now seen corresponding path program 67 times [2021-06-05 04:23:43,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:43,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097561517] [2021-06-05 04:23:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097561517] [2021-06-05 04:23:43,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097561517] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:43,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:43,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:43,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052992296] [2021-06-05 04:23:43,697 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:43,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:43,698 INFO L87 Difference]: Start difference. First operand 138 states and 408 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,764 INFO L93 Difference]: Finished difference Result 214 states and 596 transitions. [2021-06-05 04:23:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,765 INFO L225 Difference]: With dead ends: 214 [2021-06-05 04:23:43,765 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 04:23:43,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 04:23:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2021-06-05 04:23:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.007575757575758) internal successors, (397), 132 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 397 transitions. [2021-06-05 04:23:43,767 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 397 transitions. Word has length 16 [2021-06-05 04:23:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,767 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 397 transitions. [2021-06-05 04:23:43,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 397 transitions. [2021-06-05 04:23:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,767 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,768 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:43,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2021-06-05 04:23:43,768 INFO L430 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:43,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 271584158, now seen corresponding path program 66 times [2021-06-05 04:23:43,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:43,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721390004] [2021-06-05 04:23:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:43,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721390004] [2021-06-05 04:23:43,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721390004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:43,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940825635] [2021-06-05 04:23:43,799 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:43,832 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:23:43,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:43,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:43,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:43,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940825635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:43,878 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:43,878 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:43,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979196593] [2021-06-05 04:23:43,878 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:43,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:43,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:43,879 INFO L87 Difference]: Start difference. First operand 133 states and 397 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:43,952 INFO L93 Difference]: Finished difference Result 240 states and 672 transitions. [2021-06-05 04:23:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:43,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:43,953 INFO L225 Difference]: With dead ends: 240 [2021-06-05 04:23:43,953 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 04:23:43,953 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 04:23:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 04:23:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0223880597014925) internal successors, (405), 134 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 405 transitions. [2021-06-05 04:23:43,955 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 405 transitions. Word has length 16 [2021-06-05 04:23:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:43,955 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 405 transitions. [2021-06-05 04:23:43,955 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 405 transitions. [2021-06-05 04:23:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:43,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:43,956 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:44,156 INFO L430 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1633140264, now seen corresponding path program 67 times [2021-06-05 04:23:44,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279701943] [2021-06-05 04:23:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,182 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279701943] [2021-06-05 04:23:44,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279701943] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:44,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:44,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:44,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690116757] [2021-06-05 04:23:44,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:44,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:44,182 INFO L87 Difference]: Start difference. First operand 135 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:44,258 INFO L93 Difference]: Finished difference Result 217 states and 619 transitions. [2021-06-05 04:23:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:44,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:44,259 INFO L225 Difference]: With dead ends: 217 [2021-06-05 04:23:44,259 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 04:23:44,259 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 04:23:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 04:23:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0076335877862594) internal successors, (394), 131 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 394 transitions. [2021-06-05 04:23:44,261 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 394 transitions. Word has length 16 [2021-06-05 04:23:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:44,261 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 394 transitions. [2021-06-05 04:23:44,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 394 transitions. [2021-06-05 04:23:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:44,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:44,261 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-06-05 04:23:44,261 INFO L430 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1191160378, now seen corresponding path program 68 times [2021-06-05 04:23:44,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050088501] [2021-06-05 04:23:44,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050088501] [2021-06-05 04:23:44,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050088501] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:44,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:44,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:44,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843620723] [2021-06-05 04:23:44,285 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:44,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:44,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:44,285 INFO L87 Difference]: Start difference. First operand 132 states and 394 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:44,345 INFO L93 Difference]: Finished difference Result 218 states and 587 transitions. [2021-06-05 04:23:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:44,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:44,346 INFO L225 Difference]: With dead ends: 218 [2021-06-05 04:23:44,346 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 04:23:44,346 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 04:23:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 133. [2021-06-05 04:23:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.992424242424242) internal successors, (395), 132 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 395 transitions. [2021-06-05 04:23:44,348 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 395 transitions. Word has length 16 [2021-06-05 04:23:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:44,348 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 395 transitions. [2021-06-05 04:23:44,348 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 395 transitions. [2021-06-05 04:23:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:44,348 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:44,348 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,348 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2021-06-05 04:23:44,348 INFO L430 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1677206220, now seen corresponding path program 69 times [2021-06-05 04:23:44,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950133584] [2021-06-05 04:23:44,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950133584] [2021-06-05 04:23:44,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950133584] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:44,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:44,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:44,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757649070] [2021-06-05 04:23:44,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:44,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:44,376 INFO L87 Difference]: Start difference. First operand 133 states and 395 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:44,443 INFO L93 Difference]: Finished difference Result 215 states and 577 transitions. [2021-06-05 04:23:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:44,444 INFO L225 Difference]: With dead ends: 215 [2021-06-05 04:23:44,444 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 04:23:44,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 04:23:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2021-06-05 04:23:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9562043795620436) internal successors, (405), 137 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 405 transitions. [2021-06-05 04:23:44,446 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 405 transitions. Word has length 16 [2021-06-05 04:23:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:44,446 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 405 transitions. [2021-06-05 04:23:44,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 405 transitions. [2021-06-05 04:23:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:44,446 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:44,447 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2021-06-05 04:23:44,447 INFO L430 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1520433500, now seen corresponding path program 70 times [2021-06-05 04:23:44,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,447 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125394257] [2021-06-05 04:23:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125394257] [2021-06-05 04:23:44,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125394257] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:44,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:44,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:44,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836108261] [2021-06-05 04:23:44,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:44,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:44,473 INFO L87 Difference]: Start difference. First operand 138 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:44,534 INFO L93 Difference]: Finished difference Result 202 states and 558 transitions. [2021-06-05 04:23:44,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:44,535 INFO L225 Difference]: With dead ends: 202 [2021-06-05 04:23:44,535 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 04:23:44,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 04:23:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 132. [2021-06-05 04:23:44,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0) internal successors, (393), 131 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 393 transitions. [2021-06-05 04:23:44,537 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 393 transitions. Word has length 16 [2021-06-05 04:23:44,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:44,537 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 393 transitions. [2021-06-05 04:23:44,537 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,537 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 393 transitions. [2021-06-05 04:23:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:44,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:44,537 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-06-05 04:23:44,537 INFO L430 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash -567271218, now seen corresponding path program 68 times [2021-06-05 04:23:44,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449831469] [2021-06-05 04:23:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449831469] [2021-06-05 04:23:44,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449831469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:44,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828247849] [2021-06-05 04:23:44,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:44,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:44,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:44,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:44,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828247849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:44,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:44,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:44,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565456750] [2021-06-05 04:23:44,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:44,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:44,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:44,627 INFO L87 Difference]: Start difference. First operand 132 states and 393 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:44,704 INFO L93 Difference]: Finished difference Result 274 states and 793 transitions. [2021-06-05 04:23:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:44,704 INFO L225 Difference]: With dead ends: 274 [2021-06-05 04:23:44,704 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 04:23:44,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 50.1ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 04:23:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 134. [2021-06-05 04:23:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0) internal successors, (399), 133 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 399 transitions. [2021-06-05 04:23:44,707 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 399 transitions. Word has length 16 [2021-06-05 04:23:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:44,707 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 399 transitions. [2021-06-05 04:23:44,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 399 transitions. [2021-06-05 04:23:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:44,707 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:44,707 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:44,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable402 [2021-06-05 04:23:44,907 INFO L430 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 859329480, now seen corresponding path program 69 times [2021-06-05 04:23:44,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:44,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319980224] [2021-06-05 04:23:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:44,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319980224] [2021-06-05 04:23:44,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319980224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:44,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039143890] [2021-06-05 04:23:44,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:44,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:23:44,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:44,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:44,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:44,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039143890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:44,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:44,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:44,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210236] [2021-06-05 04:23:44,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:44,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:44,998 INFO L87 Difference]: Start difference. First operand 134 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:45,095 INFO L93 Difference]: Finished difference Result 253 states and 716 transitions. [2021-06-05 04:23:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:45,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:45,096 INFO L225 Difference]: With dead ends: 253 [2021-06-05 04:23:45,096 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 04:23:45,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 57.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 04:23:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2021-06-05 04:23:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0148148148148146) internal successors, (407), 135 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 407 transitions. [2021-06-05 04:23:45,098 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 407 transitions. Word has length 16 [2021-06-05 04:23:45,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:45,098 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 407 transitions. [2021-06-05 04:23:45,098 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 407 transitions. [2021-06-05 04:23:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:45,098 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:45,098 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:45,299 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable403 [2021-06-05 04:23:45,299 INFO L430 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2074081710, now seen corresponding path program 70 times [2021-06-05 04:23:45,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:45,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41682195] [2021-06-05 04:23:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:45,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:45,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41682195] [2021-06-05 04:23:45,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41682195] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:45,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:45,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:45,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960424827] [2021-06-05 04:23:45,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:45,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:45,356 INFO L87 Difference]: Start difference. First operand 136 states and 407 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:45,437 INFO L93 Difference]: Finished difference Result 230 states and 663 transitions. [2021-06-05 04:23:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:45,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:45,438 INFO L225 Difference]: With dead ends: 230 [2021-06-05 04:23:45,438 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 04:23:45,438 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 04:23:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2021-06-05 04:23:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 3.0) internal successors, (390), 130 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 390 transitions. [2021-06-05 04:23:45,440 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 390 transitions. Word has length 16 [2021-06-05 04:23:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:45,440 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 390 transitions. [2021-06-05 04:23:45,440 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 390 transitions. [2021-06-05 04:23:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:45,440 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:45,440 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:45,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2021-06-05 04:23:45,440 INFO L430 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2096777692, now seen corresponding path program 71 times [2021-06-05 04:23:45,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:45,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217592929] [2021-06-05 04:23:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:45,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:45,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217592929] [2021-06-05 04:23:45,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217592929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:45,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647788390] [2021-06-05 04:23:45,503 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:45,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:45,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:45,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:45,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:45,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647788390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:45,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:45,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:45,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918234357] [2021-06-05 04:23:45,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:45,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:45,615 INFO L87 Difference]: Start difference. First operand 131 states and 390 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:45,815 INFO L93 Difference]: Finished difference Result 217 states and 589 transitions. [2021-06-05 04:23:45,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:45,815 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:45,816 INFO L225 Difference]: With dead ends: 217 [2021-06-05 04:23:45,816 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 04:23:45,816 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 161.6ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:23:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 04:23:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 136. [2021-06-05 04:23:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.074074074074074) internal successors, (415), 135 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 415 transitions. [2021-06-05 04:23:45,818 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 415 transitions. Word has length 16 [2021-06-05 04:23:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:45,818 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 415 transitions. [2021-06-05 04:23:45,819 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 415 transitions. [2021-06-05 04:23:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:45,819 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:45,819 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:46,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,029 INFO L430 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -901741518, now seen corresponding path program 71 times [2021-06-05 04:23:46,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:46,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318724648] [2021-06-05 04:23:46,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:46,070 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:46,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318724648] [2021-06-05 04:23:46,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318724648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:46,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590521675] [2021-06-05 04:23:46,070 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,101 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:46,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:46,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:46,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:46,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590521675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:46,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:46,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:46,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624300099] [2021-06-05 04:23:46,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:46,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:46,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:46,158 INFO L87 Difference]: Start difference. First operand 136 states and 415 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:46,226 INFO L93 Difference]: Finished difference Result 211 states and 579 transitions. [2021-06-05 04:23:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:46,227 INFO L225 Difference]: With dead ends: 211 [2021-06-05 04:23:46,227 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 04:23:46,227 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 77.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 04:23:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 141. [2021-06-05 04:23:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.1214285714285714) internal successors, (437), 140 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 437 transitions. [2021-06-05 04:23:46,229 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 437 transitions. Word has length 16 [2021-06-05 04:23:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:46,229 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 437 transitions. [2021-06-05 04:23:46,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 437 transitions. [2021-06-05 04:23:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:46,229 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:46,230 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:46,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,430 INFO L430 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash 527213588, now seen corresponding path program 72 times [2021-06-05 04:23:46,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:46,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600354218] [2021-06-05 04:23:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:46,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:46,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600354218] [2021-06-05 04:23:46,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600354218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:46,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384015916] [2021-06-05 04:23:46,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,496 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:46,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:46,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:46,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:46,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384015916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:46,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:46,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 04:23:46,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562018007] [2021-06-05 04:23:46,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:23:46,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:23:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:46,555 INFO L87 Difference]: Start difference. First operand 141 states and 437 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:46,699 INFO L93 Difference]: Finished difference Result 221 states and 603 transitions. [2021-06-05 04:23:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:46,700 INFO L225 Difference]: With dead ends: 221 [2021-06-05 04:23:46,700 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 04:23:46,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 124.2ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:23:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 04:23:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 144. [2021-06-05 04:23:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.076923076923077) internal successors, (440), 143 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 440 transitions. [2021-06-05 04:23:46,702 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 440 transitions. Word has length 16 [2021-06-05 04:23:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:46,702 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 440 transitions. [2021-06-05 04:23:46,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 440 transitions. [2021-06-05 04:23:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:46,702 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:46,702 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:46,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409,136 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,903 INFO L430 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1453237032, now seen corresponding path program 72 times [2021-06-05 04:23:46,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:46,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623653734] [2021-06-05 04:23:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:46,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:46,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623653734] [2021-06-05 04:23:46,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623653734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:46,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263512166] [2021-06-05 04:23:46,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:46,959 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:46,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:46,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:46,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:47,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263512166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:47,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:47,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:47,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670027066] [2021-06-05 04:23:47,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:47,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:47,014 INFO L87 Difference]: Start difference. First operand 144 states and 440 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:47,098 INFO L93 Difference]: Finished difference Result 220 states and 605 transitions. [2021-06-05 04:23:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:47,098 INFO L225 Difference]: With dead ends: 220 [2021-06-05 04:23:47,099 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 04:23:47,099 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 04:23:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2021-06-05 04:23:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 04:23:47,101 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 04:23:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:47,101 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 04:23:47,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 04:23:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:47,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:47,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:47,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:47,301 INFO L430 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1754194180, now seen corresponding path program 73 times [2021-06-05 04:23:47,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:47,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326313817] [2021-06-05 04:23:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:47,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:47,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326313817] [2021-06-05 04:23:47,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326313817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:47,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26506949] [2021-06-05 04:23:47,332 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:47,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:47,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:47,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26506949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:47,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:47,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:47,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200201039] [2021-06-05 04:23:47,418 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:47,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:47,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:47,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:47,418 INFO L87 Difference]: Start difference. First operand 138 states and 416 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:47,502 INFO L93 Difference]: Finished difference Result 250 states and 667 transitions. [2021-06-05 04:23:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:47,503 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:47,503 INFO L225 Difference]: With dead ends: 250 [2021-06-05 04:23:47,503 INFO L226 Difference]: Without dead ends: 250 [2021-06-05 04:23:47,503 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-06-05 04:23:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 140. [2021-06-05 04:23:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.050359712230216) internal successors, (424), 139 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 424 transitions. [2021-06-05 04:23:47,505 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 424 transitions. Word has length 16 [2021-06-05 04:23:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:47,505 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 424 transitions. [2021-06-05 04:23:47,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 424 transitions. [2021-06-05 04:23:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:47,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:47,506 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:47,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable413 [2021-06-05 04:23:47,706 INFO L430 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash 217519174, now seen corresponding path program 74 times [2021-06-05 04:23:47,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:47,707 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035044688] [2021-06-05 04:23:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:47,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:47,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035044688] [2021-06-05 04:23:47,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035044688] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:47,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826973454] [2021-06-05 04:23:47,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:47,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:47,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:47,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:47,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:47,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826973454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:47,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:47,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:47,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612410530] [2021-06-05 04:23:47,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:47,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:47,831 INFO L87 Difference]: Start difference. First operand 140 states and 424 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:47,908 INFO L93 Difference]: Finished difference Result 228 states and 613 transitions. [2021-06-05 04:23:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:47,909 INFO L225 Difference]: With dead ends: 228 [2021-06-05 04:23:47,909 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 04:23:47,909 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 04:23:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2021-06-05 04:23:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 04:23:47,914 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 04:23:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:47,914 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 04:23:47,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 04:23:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:47,915 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:47,915 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:48,139 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable414 [2021-06-05 04:23:48,139 INFO L430 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1643175192, now seen corresponding path program 73 times [2021-06-05 04:23:48,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:48,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954325233] [2021-06-05 04:23:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:48,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954325233] [2021-06-05 04:23:48,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954325233] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:48,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:48,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:48,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142435271] [2021-06-05 04:23:48,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:48,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:48,168 INFO L87 Difference]: Start difference. First operand 138 states and 416 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:48,262 INFO L93 Difference]: Finished difference Result 235 states and 620 transitions. [2021-06-05 04:23:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:48,263 INFO L225 Difference]: With dead ends: 235 [2021-06-05 04:23:48,263 INFO L226 Difference]: Without dead ends: 231 [2021-06-05 04:23:48,264 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-06-05 04:23:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 140. [2021-06-05 04:23:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.0215827338129495) internal successors, (420), 139 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 420 transitions. [2021-06-05 04:23:48,266 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 420 transitions. Word has length 16 [2021-06-05 04:23:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:48,267 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 420 transitions. [2021-06-05 04:23:48,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 420 transitions. [2021-06-05 04:23:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:48,267 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:48,267 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:48,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2021-06-05 04:23:48,267 INFO L430 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1716547672, now seen corresponding path program 74 times [2021-06-05 04:23:48,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:48,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108967255] [2021-06-05 04:23:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:48,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108967255] [2021-06-05 04:23:48,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108967255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:48,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:48,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:48,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411470608] [2021-06-05 04:23:48,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:48,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:48,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:48,298 INFO L87 Difference]: Start difference. First operand 140 states and 420 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:48,396 INFO L93 Difference]: Finished difference Result 218 states and 594 transitions. [2021-06-05 04:23:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:48,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:48,397 INFO L225 Difference]: With dead ends: 218 [2021-06-05 04:23:48,397 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 04:23:48,397 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:48,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 04:23:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2021-06-05 04:23:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0291970802919708) internal successors, (415), 137 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 415 transitions. [2021-06-05 04:23:48,399 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 415 transitions. Word has length 16 [2021-06-05 04:23:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:48,399 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 415 transitions. [2021-06-05 04:23:48,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 415 transitions. [2021-06-05 04:23:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:48,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:48,399 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:48,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2021-06-05 04:23:48,399 INFO L430 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1912712838, now seen corresponding path program 75 times [2021-06-05 04:23:48,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:48,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405088569] [2021-06-05 04:23:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:48,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405088569] [2021-06-05 04:23:48,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405088569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:48,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:48,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:48,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158982409] [2021-06-05 04:23:48,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:48,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:48,426 INFO L87 Difference]: Start difference. First operand 138 states and 415 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:48,492 INFO L93 Difference]: Finished difference Result 235 states and 613 transitions. [2021-06-05 04:23:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:48,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:48,492 INFO L225 Difference]: With dead ends: 235 [2021-06-05 04:23:48,493 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 04:23:48,493 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 04:23:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 140. [2021-06-05 04:23:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.014388489208633) internal successors, (419), 139 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 419 transitions. [2021-06-05 04:23:48,495 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 419 transitions. Word has length 16 [2021-06-05 04:23:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:48,495 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 419 transitions. [2021-06-05 04:23:48,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 419 transitions. [2021-06-05 04:23:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:48,495 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:48,495 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:48,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2021-06-05 04:23:48,495 INFO L430 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 815385262, now seen corresponding path program 76 times [2021-06-05 04:23:48,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:48,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459840863] [2021-06-05 04:23:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:48,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459840863] [2021-06-05 04:23:48,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459840863] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:48,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:48,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:48,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709215275] [2021-06-05 04:23:48,544 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:48,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:48,545 INFO L87 Difference]: Start difference. First operand 140 states and 419 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:48,615 INFO L93 Difference]: Finished difference Result 221 states and 592 transitions. [2021-06-05 04:23:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:48,616 INFO L225 Difference]: With dead ends: 221 [2021-06-05 04:23:48,616 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 04:23:48,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 04:23:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 139. [2021-06-05 04:23:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0144927536231885) internal successors, (416), 138 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 416 transitions. [2021-06-05 04:23:48,619 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 416 transitions. Word has length 16 [2021-06-05 04:23:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:48,619 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 416 transitions. [2021-06-05 04:23:48,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 416 transitions. [2021-06-05 04:23:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:48,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:48,619 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:48,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2021-06-05 04:23:48,619 INFO L430 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1754719096, now seen corresponding path program 75 times [2021-06-05 04:23:48,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:48,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933348592] [2021-06-05 04:23:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:48,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933348592] [2021-06-05 04:23:48,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933348592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:48,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455181561] [2021-06-05 04:23:48,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:48,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:23:48,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:48,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:48,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455181561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:48,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:48,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:48,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302455890] [2021-06-05 04:23:48,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:48,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:48,732 INFO L87 Difference]: Start difference. First operand 139 states and 416 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:48,825 INFO L93 Difference]: Finished difference Result 254 states and 684 transitions. [2021-06-05 04:23:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:48,826 INFO L225 Difference]: With dead ends: 254 [2021-06-05 04:23:48,826 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 04:23:48,826 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 04:23:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 141. [2021-06-05 04:23:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.0285714285714285) internal successors, (424), 140 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 424 transitions. [2021-06-05 04:23:48,828 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 424 transitions. Word has length 16 [2021-06-05 04:23:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:48,828 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 424 transitions. [2021-06-05 04:23:48,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 424 transitions. [2021-06-05 04:23:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:48,829 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:48,829 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:49,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable421 [2021-06-05 04:23:49,029 INFO L430 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:49,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1178692094, now seen corresponding path program 76 times [2021-06-05 04:23:49,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:49,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496963569] [2021-06-05 04:23:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:49,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496963569] [2021-06-05 04:23:49,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496963569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:49,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:49,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:49,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454982296] [2021-06-05 04:23:49,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:49,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:49,061 INFO L87 Difference]: Start difference. First operand 141 states and 424 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:49,157 INFO L93 Difference]: Finished difference Result 228 states and 620 transitions. [2021-06-05 04:23:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:49,157 INFO L225 Difference]: With dead ends: 228 [2021-06-05 04:23:49,157 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 04:23:49,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 04:23:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2021-06-05 04:23:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0) internal successors, (408), 136 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 408 transitions. [2021-06-05 04:23:49,160 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 408 transitions. Word has length 16 [2021-06-05 04:23:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:49,160 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 408 transitions. [2021-06-05 04:23:49,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 408 transitions. [2021-06-05 04:23:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:49,160 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:49,160 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:49,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2021-06-05 04:23:49,160 INFO L430 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash 433988996, now seen corresponding path program 77 times [2021-06-05 04:23:49,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:49,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783133763] [2021-06-05 04:23:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:49,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783133763] [2021-06-05 04:23:49,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783133763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:49,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565632887] [2021-06-05 04:23:49,190 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:49,219 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:23:49,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:49,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:49,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565632887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:49,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:49,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:49,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778098745] [2021-06-05 04:23:49,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:49,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:49,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:49,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:49,282 INFO L87 Difference]: Start difference. First operand 137 states and 408 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:49,378 INFO L93 Difference]: Finished difference Result 206 states and 557 transitions. [2021-06-05 04:23:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:49,379 INFO L225 Difference]: With dead ends: 206 [2021-06-05 04:23:49,379 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 04:23:49,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 04:23:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 136. [2021-06-05 04:23:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9555555555555557) internal successors, (399), 135 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 399 transitions. [2021-06-05 04:23:49,380 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 399 transitions. Word has length 16 [2021-06-05 04:23:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:49,381 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 399 transitions. [2021-06-05 04:23:49,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 399 transitions. [2021-06-05 04:23:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:49,381 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:49,381 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:49,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:49,582 INFO L430 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1889264946, now seen corresponding path program 78 times [2021-06-05 04:23:49,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:49,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228888573] [2021-06-05 04:23:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:49,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228888573] [2021-06-05 04:23:49,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228888573] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:49,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283454616] [2021-06-05 04:23:49,611 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:49,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:23:49,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:49,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:49,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283454616] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:49,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:49,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:49,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677201458] [2021-06-05 04:23:49,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:49,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:49,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:49,686 INFO L87 Difference]: Start difference. First operand 136 states and 399 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:49,758 INFO L93 Difference]: Finished difference Result 197 states and 530 transitions. [2021-06-05 04:23:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:49,758 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:49,758 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 04:23:49,759 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 04:23:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2021-06-05 04:23:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.9689922480620154) internal successors, (383), 129 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 383 transitions. [2021-06-05 04:23:49,760 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 383 transitions. Word has length 16 [2021-06-05 04:23:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:49,760 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 383 transitions. [2021-06-05 04:23:49,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 383 transitions. [2021-06-05 04:23:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:49,761 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:49,761 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:49,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable424 [2021-06-05 04:23:49,961 INFO L430 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1506544558, now seen corresponding path program 79 times [2021-06-05 04:23:49,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:49,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129290046] [2021-06-05 04:23:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:49,989 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:49,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129290046] [2021-06-05 04:23:49,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129290046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:49,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918794584] [2021-06-05 04:23:49,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:50,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918794584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:50,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:50,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:50,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141839265] [2021-06-05 04:23:50,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:50,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:50,062 INFO L87 Difference]: Start difference. First operand 130 states and 383 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,124 INFO L93 Difference]: Finished difference Result 176 states and 481 transitions. [2021-06-05 04:23:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,125 INFO L225 Difference]: With dead ends: 176 [2021-06-05 04:23:50,125 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 04:23:50,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 04:23:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2021-06-05 04:23:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.952755905511811) internal successors, (375), 127 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 375 transitions. [2021-06-05 04:23:50,126 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 375 transitions. Word has length 16 [2021-06-05 04:23:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,126 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 375 transitions. [2021-06-05 04:23:50,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 375 transitions. [2021-06-05 04:23:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,127 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,127 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable427 [2021-06-05 04:23:50,327 INFO L430 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1055429870, now seen corresponding path program 77 times [2021-06-05 04:23:50,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672890848] [2021-06-05 04:23:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672890848] [2021-06-05 04:23:50,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672890848] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729534378] [2021-06-05 04:23:50,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,354 INFO L87 Difference]: Start difference. First operand 128 states and 375 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,447 INFO L93 Difference]: Finished difference Result 175 states and 467 transitions. [2021-06-05 04:23:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,447 INFO L225 Difference]: With dead ends: 175 [2021-06-05 04:23:50,447 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 04:23:50,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 04:23:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2021-06-05 04:23:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.931297709923664) internal successors, (384), 131 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 384 transitions. [2021-06-05 04:23:50,449 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 384 transitions. Word has length 16 [2021-06-05 04:23:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,449 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 384 transitions. [2021-06-05 04:23:50,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 384 transitions. [2021-06-05 04:23:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,450 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,450 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2021-06-05 04:23:50,450 INFO L430 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1128802350, now seen corresponding path program 78 times [2021-06-05 04:23:50,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404906786] [2021-06-05 04:23:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404906786] [2021-06-05 04:23:50,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404906786] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062715593] [2021-06-05 04:23:50,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,475 INFO L87 Difference]: Start difference. First operand 132 states and 384 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,575 INFO L93 Difference]: Finished difference Result 173 states and 464 transitions. [2021-06-05 04:23:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,576 INFO L225 Difference]: With dead ends: 173 [2021-06-05 04:23:50,576 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 04:23:50,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 04:23:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2021-06-05 04:23:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.937984496124031) internal successors, (379), 129 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 379 transitions. [2021-06-05 04:23:50,578 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 379 transitions. Word has length 16 [2021-06-05 04:23:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,578 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 379 transitions. [2021-06-05 04:23:50,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 379 transitions. [2021-06-05 04:23:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,578 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,578 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-06-05 04:23:50,578 INFO L430 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1126176574, now seen corresponding path program 79 times [2021-06-05 04:23:50,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886192701] [2021-06-05 04:23:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886192701] [2021-06-05 04:23:50,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886192701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,601 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764807173] [2021-06-05 04:23:50,601 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,601 INFO L87 Difference]: Start difference. First operand 130 states and 379 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,683 INFO L93 Difference]: Finished difference Result 161 states and 446 transitions. [2021-06-05 04:23:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,684 INFO L225 Difference]: With dead ends: 161 [2021-06-05 04:23:50,684 INFO L226 Difference]: Without dead ends: 156 [2021-06-05 04:23:50,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-06-05 04:23:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2021-06-05 04:23:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9375) internal successors, (376), 128 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 376 transitions. [2021-06-05 04:23:50,685 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 376 transitions. Word has length 16 [2021-06-05 04:23:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,685 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 376 transitions. [2021-06-05 04:23:50,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 376 transitions. [2021-06-05 04:23:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,686 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,686 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2021-06-05 04:23:50,686 INFO L430 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash -700417548, now seen corresponding path program 80 times [2021-06-05 04:23:50,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265602285] [2021-06-05 04:23:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265602285] [2021-06-05 04:23:50,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265602285] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285068451] [2021-06-05 04:23:50,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,718 INFO L87 Difference]: Start difference. First operand 129 states and 376 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,778 INFO L93 Difference]: Finished difference Result 186 states and 490 transitions. [2021-06-05 04:23:50,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,779 INFO L225 Difference]: With dead ends: 186 [2021-06-05 04:23:50,779 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 04:23:50,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 04:23:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 04:23:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8962962962962964) internal successors, (391), 135 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 391 transitions. [2021-06-05 04:23:50,781 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 391 transitions. Word has length 16 [2021-06-05 04:23:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,781 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 391 transitions. [2021-06-05 04:23:50,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 391 transitions. [2021-06-05 04:23:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,781 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,781 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2021-06-05 04:23:50,781 INFO L430 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1797745124, now seen corresponding path program 81 times [2021-06-05 04:23:50,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35523363] [2021-06-05 04:23:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35523363] [2021-06-05 04:23:50,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35523363] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,818 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,818 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,818 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198644172] [2021-06-05 04:23:50,818 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,819 INFO L87 Difference]: Start difference. First operand 136 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,890 INFO L93 Difference]: Finished difference Result 185 states and 488 transitions. [2021-06-05 04:23:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,890 INFO L225 Difference]: With dead ends: 185 [2021-06-05 04:23:50,890 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 04:23:50,890 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 04:23:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 135. [2021-06-05 04:23:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8955223880597014) internal successors, (388), 134 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 388 transitions. [2021-06-05 04:23:50,892 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 388 transitions. Word has length 16 [2021-06-05 04:23:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,892 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 388 transitions. [2021-06-05 04:23:50,892 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 388 transitions. [2021-06-05 04:23:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,893 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,893 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2021-06-05 04:23:50,893 INFO L430 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash 351051412, now seen corresponding path program 82 times [2021-06-05 04:23:50,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955338001] [2021-06-05 04:23:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:50,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:50,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955338001] [2021-06-05 04:23:50,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955338001] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:50,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:50,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:50,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894038810] [2021-06-05 04:23:50,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:50,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:50,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:50,926 INFO L87 Difference]: Start difference. First operand 135 states and 388 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:50,987 INFO L93 Difference]: Finished difference Result 172 states and 468 transitions. [2021-06-05 04:23:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:50,987 INFO L225 Difference]: With dead ends: 172 [2021-06-05 04:23:50,987 INFO L226 Difference]: Without dead ends: 167 [2021-06-05 04:23:50,987 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-06-05 04:23:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2021-06-05 04:23:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9296875) internal successors, (375), 128 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 375 transitions. [2021-06-05 04:23:50,989 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 375 transitions. Word has length 16 [2021-06-05 04:23:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:50,989 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 375 transitions. [2021-06-05 04:23:50,989 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 375 transitions. [2021-06-05 04:23:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:50,989 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:50,989 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:50,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2021-06-05 04:23:50,989 INFO L430 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1836118152, now seen corresponding path program 80 times [2021-06-05 04:23:50,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:50,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685931387] [2021-06-05 04:23:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685931387] [2021-06-05 04:23:51,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685931387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:51,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370467831] [2021-06-05 04:23:51,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:51,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:51,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:51,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:51,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370467831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:51,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:51,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 04:23:51,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989847957] [2021-06-05 04:23:51,097 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:23:51,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:23:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,098 INFO L87 Difference]: Start difference. First operand 129 states and 375 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,181 INFO L93 Difference]: Finished difference Result 197 states and 540 transitions. [2021-06-05 04:23:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,182 INFO L225 Difference]: With dead ends: 197 [2021-06-05 04:23:51,182 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 04:23:51,182 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 04:23:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2021-06-05 04:23:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.962121212121212) internal successors, (391), 132 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 391 transitions. [2021-06-05 04:23:51,184 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 391 transitions. Word has length 16 [2021-06-05 04:23:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,184 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 391 transitions. [2021-06-05 04:23:51,184 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 391 transitions. [2021-06-05 04:23:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,184 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,184 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436,144 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:51,389 INFO L430 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1097293038, now seen corresponding path program 81 times [2021-06-05 04:23:51,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789036537] [2021-06-05 04:23:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789036537] [2021-06-05 04:23:51,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789036537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746134451] [2021-06-05 04:23:51,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,416 INFO L87 Difference]: Start difference. First operand 133 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,507 INFO L93 Difference]: Finished difference Result 193 states and 523 transitions. [2021-06-05 04:23:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,508 INFO L225 Difference]: With dead ends: 193 [2021-06-05 04:23:51,508 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 04:23:51,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 04:23:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 131. [2021-06-05 04:23:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.9461538461538463) internal successors, (383), 130 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 383 transitions. [2021-06-05 04:23:51,510 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 383 transitions. Word has length 16 [2021-06-05 04:23:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,510 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 383 transitions. [2021-06-05 04:23:51,510 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 383 transitions. [2021-06-05 04:23:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,510 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,510 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2021-06-05 04:23:51,510 INFO L430 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1632522840, now seen corresponding path program 82 times [2021-06-05 04:23:51,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892132218] [2021-06-05 04:23:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892132218] [2021-06-05 04:23:51,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892132218] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964916450] [2021-06-05 04:23:51,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,534 INFO L87 Difference]: Start difference. First operand 131 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,620 INFO L93 Difference]: Finished difference Result 170 states and 473 transitions. [2021-06-05 04:23:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,620 INFO L225 Difference]: With dead ends: 170 [2021-06-05 04:23:51,620 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 04:23:51,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 04:23:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-06-05 04:23:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.9291338582677167) internal successors, (372), 127 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 372 transitions. [2021-06-05 04:23:51,622 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 372 transitions. Word has length 16 [2021-06-05 04:23:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,622 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 372 transitions. [2021-06-05 04:23:51,622 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 372 transitions. [2021-06-05 04:23:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,623 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,623 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2021-06-05 04:23:51,623 INFO L430 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1788497036, now seen corresponding path program 83 times [2021-06-05 04:23:51,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775806733] [2021-06-05 04:23:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775806733] [2021-06-05 04:23:51,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775806733] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485727397] [2021-06-05 04:23:51,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,646 INFO L87 Difference]: Start difference. First operand 128 states and 372 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,707 INFO L93 Difference]: Finished difference Result 154 states and 417 transitions. [2021-06-05 04:23:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,707 INFO L225 Difference]: With dead ends: 154 [2021-06-05 04:23:51,707 INFO L226 Difference]: Without dead ends: 148 [2021-06-05 04:23:51,708 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-06-05 04:23:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2021-06-05 04:23:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9140625) internal successors, (373), 128 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 373 transitions. [2021-06-05 04:23:51,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 373 transitions. Word has length 16 [2021-06-05 04:23:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,709 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 373 transitions. [2021-06-05 04:23:51,709 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 373 transitions. [2021-06-05 04:23:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,709 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,710 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2021-06-05 04:23:51,710 INFO L430 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1079869562, now seen corresponding path program 84 times [2021-06-05 04:23:51,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485761383] [2021-06-05 04:23:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485761383] [2021-06-05 04:23:51,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485761383] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466191016] [2021-06-05 04:23:51,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,736 INFO L87 Difference]: Start difference. First operand 129 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,819 INFO L93 Difference]: Finished difference Result 164 states and 429 transitions. [2021-06-05 04:23:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,820 INFO L225 Difference]: With dead ends: 164 [2021-06-05 04:23:51,820 INFO L226 Difference]: Without dead ends: 161 [2021-06-05 04:23:51,820 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-06-05 04:23:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2021-06-05 04:23:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 04:23:51,822 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 04:23:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,822 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 04:23:51,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 04:23:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,822 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,822 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2021-06-05 04:23:51,822 INFO L430 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2117770158, now seen corresponding path program 85 times [2021-06-05 04:23:51,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218157724] [2021-06-05 04:23:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218157724] [2021-06-05 04:23:51,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218157724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900400681] [2021-06-05 04:23:51,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,848 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:51,920 INFO L93 Difference]: Finished difference Result 151 states and 410 transitions. [2021-06-05 04:23:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:51,921 INFO L225 Difference]: With dead ends: 151 [2021-06-05 04:23:51,921 INFO L226 Difference]: Without dead ends: 147 [2021-06-05 04:23:51,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-06-05 04:23:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2021-06-05 04:23:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.921259842519685) internal successors, (371), 127 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 371 transitions. [2021-06-05 04:23:51,922 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 371 transitions. Word has length 16 [2021-06-05 04:23:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:51,923 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 371 transitions. [2021-06-05 04:23:51,923 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 371 transitions. [2021-06-05 04:23:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:51,923 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:51,923 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:51,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-06-05 04:23:51,923 INFO L430 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1586215828, now seen corresponding path program 86 times [2021-06-05 04:23:51,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:51,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976206894] [2021-06-05 04:23:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:51,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:51,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976206894] [2021-06-05 04:23:51,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976206894] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:51,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:51,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:51,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787779335] [2021-06-05 04:23:51,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:51,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:51,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:51,950 INFO L87 Difference]: Start difference. First operand 128 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:52,020 INFO L93 Difference]: Finished difference Result 147 states and 399 transitions. [2021-06-05 04:23:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:52,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:52,021 INFO L225 Difference]: With dead ends: 147 [2021-06-05 04:23:52,021 INFO L226 Difference]: Without dead ends: 144 [2021-06-05 04:23:52,021 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.1ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-06-05 04:23:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2021-06-05 04:23:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 04:23:52,022 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 16 [2021-06-05 04:23:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:52,022 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 04:23:52,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 04:23:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:52,023 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:52,023 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:52,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2021-06-05 04:23:52,023 INFO L430 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1611423892, now seen corresponding path program 87 times [2021-06-05 04:23:52,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:52,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370889422] [2021-06-05 04:23:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:52,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370889422] [2021-06-05 04:23:52,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370889422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:52,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:52,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:52,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126749272] [2021-06-05 04:23:52,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:52,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:52,048 INFO L87 Difference]: Start difference. First operand 135 states and 386 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:52,123 INFO L93 Difference]: Finished difference Result 146 states and 397 transitions. [2021-06-05 04:23:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:52,124 INFO L225 Difference]: With dead ends: 146 [2021-06-05 04:23:52,124 INFO L226 Difference]: Without dead ends: 143 [2021-06-05 04:23:52,124 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 57.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-06-05 04:23:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2021-06-05 04:23:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 04:23:52,126 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 04:23:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:52,126 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 04:23:52,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 04:23:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:52,127 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:52,127 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:52,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2021-06-05 04:23:52,127 INFO L430 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash -534746868, now seen corresponding path program 88 times [2021-06-05 04:23:52,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:52,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589870285] [2021-06-05 04:23:52,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:52,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589870285] [2021-06-05 04:23:52,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589870285] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:52,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:52,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:52,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032448898] [2021-06-05 04:23:52,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:52,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:52,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:52,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:52,154 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:52,213 INFO L93 Difference]: Finished difference Result 133 states and 377 transitions. [2021-06-05 04:23:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:52,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:52,213 INFO L225 Difference]: With dead ends: 133 [2021-06-05 04:23:52,213 INFO L226 Difference]: Without dead ends: 127 [2021-06-05 04:23:52,213 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-06-05 04:23:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-06-05 04:23:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.9285714285714284) internal successors, (369), 126 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 369 transitions. [2021-06-05 04:23:52,218 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 369 transitions. Word has length 16 [2021-06-05 04:23:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:52,218 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 369 transitions. [2021-06-05 04:23:52,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 369 transitions. [2021-06-05 04:23:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:52,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:52,218 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:52,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2021-06-05 04:23:52,218 INFO L430 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1956099518, now seen corresponding path program 83 times [2021-06-05 04:23:52,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:52,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730396198] [2021-06-05 04:23:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:52,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730396198] [2021-06-05 04:23:52,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730396198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:52,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629729723] [2021-06-05 04:23:52,244 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:52,269 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:23:52,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:52,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:52,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629729723] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:52,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:52,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 04:23:52,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614384172] [2021-06-05 04:23:52,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 04:23:52,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 04:23:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 04:23:52,301 INFO L87 Difference]: Start difference. First operand 127 states and 369 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:52,375 INFO L93 Difference]: Finished difference Result 176 states and 508 transitions. [2021-06-05 04:23:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:52,376 INFO L225 Difference]: With dead ends: 176 [2021-06-05 04:23:52,376 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 04:23:52,376 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:23:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 04:23:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2021-06-05 04:23:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.925) internal successors, (351), 120 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 351 transitions. [2021-06-05 04:23:52,377 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 351 transitions. Word has length 16 [2021-06-05 04:23:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:52,377 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 351 transitions. [2021-06-05 04:23:52,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 351 transitions. [2021-06-05 04:23:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:52,378 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:52,378 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:52,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable445 [2021-06-05 04:23:52,578 INFO L430 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -912267080, now seen corresponding path program 84 times [2021-06-05 04:23:52,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:52,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202454342] [2021-06-05 04:23:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:52,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202454342] [2021-06-05 04:23:52,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202454342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:52,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111254613] [2021-06-05 04:23:52,605 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:52,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:23:52,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:52,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:52,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:52,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111254613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:52,683 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:52,683 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 04:23:52,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535603937] [2021-06-05 04:23:52,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 04:23:52,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 04:23:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 04:23:52,684 INFO L87 Difference]: Start difference. First operand 121 states and 351 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:52,775 INFO L93 Difference]: Finished difference Result 193 states and 540 transitions. [2021-06-05 04:23:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:52,776 INFO L225 Difference]: With dead ends: 193 [2021-06-05 04:23:52,776 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 04:23:52,776 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:23:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 04:23:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2021-06-05 04:23:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.942622950819672) internal successors, (359), 122 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 359 transitions. [2021-06-05 04:23:52,777 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 359 transitions. Word has length 16 [2021-06-05 04:23:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:52,777 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 359 transitions. [2021-06-05 04:23:52,777 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 359 transitions. [2021-06-05 04:23:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:52,778 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:52,778 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:52,978 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:52,978 INFO L430 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash 449289026, now seen corresponding path program 85 times [2021-06-05 04:23:52,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:52,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215679130] [2021-06-05 04:23:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:53,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:53,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215679130] [2021-06-05 04:23:53,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215679130] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:53,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:53,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:53,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909615832] [2021-06-05 04:23:53,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:53,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:53,002 INFO L87 Difference]: Start difference. First operand 123 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:53,077 INFO L93 Difference]: Finished difference Result 170 states and 487 transitions. [2021-06-05 04:23:53,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:53,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:53,078 INFO L225 Difference]: With dead ends: 170 [2021-06-05 04:23:53,078 INFO L226 Difference]: Without dead ends: 168 [2021-06-05 04:23:53,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-06-05 04:23:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2021-06-05 04:23:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.9237288135593222) internal successors, (345), 118 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 345 transitions. [2021-06-05 04:23:53,080 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 345 transitions. Word has length 16 [2021-06-05 04:23:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:53,080 INFO L482 AbstractCegarLoop]: Abstraction has 119 states and 345 transitions. [2021-06-05 04:23:53,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 345 transitions. [2021-06-05 04:23:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:53,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:53,080 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:53,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2021-06-05 04:23:53,080 INFO L430 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1418613346, now seen corresponding path program 86 times [2021-06-05 04:23:53,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:53,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909392837] [2021-06-05 04:23:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:53,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:53,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909392837] [2021-06-05 04:23:53,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909392837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:53,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488577859] [2021-06-05 04:23:53,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:53,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:23:53,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:23:53,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 04:23:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:53,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488577859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:53,187 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:53,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 04:23:53,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735697513] [2021-06-05 04:23:53,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:23:53,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:23:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:23:53,188 INFO L87 Difference]: Start difference. First operand 119 states and 345 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:53,308 INFO L93 Difference]: Finished difference Result 151 states and 417 transitions. [2021-06-05 04:23:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:53,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:53,308 INFO L225 Difference]: With dead ends: 151 [2021-06-05 04:23:53,308 INFO L226 Difference]: Without dead ends: 151 [2021-06-05 04:23:53,309 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:23:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-06-05 04:23:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2021-06-05 04:23:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.871794871794872) internal successors, (336), 117 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 336 transitions. [2021-06-05 04:23:53,311 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 336 transitions. Word has length 16 [2021-06-05 04:23:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:53,311 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 336 transitions. [2021-06-05 04:23:53,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 336 transitions. [2021-06-05 04:23:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:53,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:53,311 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:53,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable448 [2021-06-05 04:23:53,533 INFO L430 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -57057240, now seen corresponding path program 87 times [2021-06-05 04:23:53,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:53,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641781787] [2021-06-05 04:23:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:53,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:53,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641781787] [2021-06-05 04:23:53,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641781787] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:53,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:53,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:53,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033971922] [2021-06-05 04:23:53,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:53,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:53,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:53,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:53,562 INFO L87 Difference]: Start difference. First operand 118 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:53,653 INFO L93 Difference]: Finished difference Result 147 states and 400 transitions. [2021-06-05 04:23:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:53,653 INFO L225 Difference]: With dead ends: 147 [2021-06-05 04:23:53,653 INFO L226 Difference]: Without dead ends: 145 [2021-06-05 04:23:53,653 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-06-05 04:23:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2021-06-05 04:23:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.8521739130434782) internal successors, (328), 115 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 328 transitions. [2021-06-05 04:23:53,655 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 328 transitions. Word has length 16 [2021-06-05 04:23:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:53,655 INFO L482 AbstractCegarLoop]: Abstraction has 116 states and 328 transitions. [2021-06-05 04:23:53,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 328 transitions. [2021-06-05 04:23:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 04:23:53,655 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:53,655 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:53,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2021-06-05 04:23:53,655 INFO L430 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash -592287042, now seen corresponding path program 88 times [2021-06-05 04:23:53,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:53,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216051145] [2021-06-05 04:23:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:53,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:53,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216051145] [2021-06-05 04:23:53,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216051145] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 04:23:53,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 04:23:53,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 04:23:53,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896886883] [2021-06-05 04:23:53,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 04:23:53,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 04:23:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 04:23:53,678 INFO L87 Difference]: Start difference. First operand 116 states and 328 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:23:53,760 INFO L93 Difference]: Finished difference Result 124 states and 350 transitions. [2021-06-05 04:23:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:23:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-06-05 04:23:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:23:53,760 INFO L225 Difference]: With dead ends: 124 [2021-06-05 04:23:53,760 INFO L226 Difference]: Without dead ends: 120 [2021-06-05 04:23:53,760 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:23:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-06-05 04:23:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2021-06-05 04:23:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.878504672897196) internal successors, (308), 107 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 308 transitions. [2021-06-05 04:23:53,762 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 308 transitions. Word has length 16 [2021-06-05 04:23:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:23:53,762 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 308 transitions. [2021-06-05 04:23:53,762 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 308 transitions. [2021-06-05 04:23:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:23:53,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:23:53,763 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:23:53,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2021-06-05 04:23:53,763 INFO L430 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:23:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:23:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1638627788, now seen corresponding path program 1 times [2021-06-05 04:23:53,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:23:53,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927767577] [2021-06-05 04:23:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:23:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:54,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:23:54,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927767577] [2021-06-05 04:23:54,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927767577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:54,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113630177] [2021-06-05 04:23:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:23:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:23:54,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:23:54,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:23:54,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:23:54,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:23:54,253 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:23:54,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:23:54,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:23:54,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:23:54,266 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:23:54,274 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:23:54,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:23:54,321 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:113 [2021-06-05 04:23:54,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:23:54,624 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:23:54,629 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:23:54,635 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:23:54,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,699 INFO L628 ElimStorePlain]: treesize reduction 78, result has 57.1 percent of original size [2021-06-05 04:23:54,699 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:23:54,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:23:54,704 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:23:54,706 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:23:54,709 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:23:54,733 INFO L628 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2021-06-05 04:23:54,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:23:54,737 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:23:54,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:23:54,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:23:54,749 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:224, output treesize:32 [2021-06-05 04:23:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:23:54,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113630177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:23:54,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:23:54,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:23:54,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368771896] [2021-06-05 04:23:54,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:23:54,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:23:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:23:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:23:54,785 INFO L87 Difference]: Start difference. First operand 108 states and 308 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:23:55,320 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-06-05 04:23:55,614 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2021-06-05 04:23:55,778 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-06-05 04:23:56,074 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2021-06-05 04:23:56,633 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2021-06-05 04:23:56,915 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 04:23:57,159 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 04:23:57,534 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2021-06-05 04:23:57,968 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 93 [2021-06-05 04:23:58,353 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2021-06-05 04:23:58,575 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-06-05 04:23:58,953 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2021-06-05 04:23:59,303 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-06-05 04:23:59,708 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2021-06-05 04:24:00,065 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2021-06-05 04:24:00,450 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2021-06-05 04:24:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:00,512 INFO L93 Difference]: Finished difference Result 324 states and 849 transitions. [2021-06-05 04:24:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 04:24:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:00,513 INFO L225 Difference]: With dead ends: 324 [2021-06-05 04:24:00,513 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 04:24:00,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 5605.7ms TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 04:24:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 04:24:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2021-06-05 04:24:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.86144578313253) internal successors, (475), 166 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 475 transitions. [2021-06-05 04:24:00,516 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 475 transitions. Word has length 17 [2021-06-05 04:24:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:00,516 INFO L482 AbstractCegarLoop]: Abstraction has 167 states and 475 transitions. [2021-06-05 04:24:00,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 475 transitions. [2021-06-05 04:24:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:00,517 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:00,517 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:00,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:00,729 INFO L430 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -310438566, now seen corresponding path program 2 times [2021-06-05 04:24:00,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:00,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138280528] [2021-06-05 04:24:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:01,125 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:01,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138280528] [2021-06-05 04:24:01,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138280528] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:01,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275592172] [2021-06-05 04:24:01,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:01,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:01,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:01,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:01,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:01,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:01,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:01,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:01,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:01,273 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:01,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:01,277 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:01,281 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:01,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:01,321 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:139 [2021-06-05 04:24:01,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:01,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:01,526 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:01,531 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,593 INFO L628 ElimStorePlain]: treesize reduction 46, result has 68.9 percent of original size [2021-06-05 04:24:01,593 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:01,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:01,597 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:24:01,601 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,646 INFO L628 ElimStorePlain]: treesize reduction 20, result has 77.3 percent of original size [2021-06-05 04:24:01,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:01,650 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:01,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:24:01,655 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:01,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:01,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:01,670 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:01,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:01,680 INFO L518 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2021-06-05 04:24:01,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:01,681 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:179, output treesize:32 [2021-06-05 04:24:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:01,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275592172] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:01,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:01,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:24:01,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879161878] [2021-06-05 04:24:01,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:24:01,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:01,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:24:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:24:01,717 INFO L87 Difference]: Start difference. First operand 167 states and 475 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:02,532 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-06-05 04:24:02,778 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2021-06-05 04:24:02,985 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-06-05 04:24:03,232 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2021-06-05 04:24:03,622 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-06-05 04:24:04,010 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2021-06-05 04:24:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:04,171 INFO L93 Difference]: Finished difference Result 264 states and 736 transitions. [2021-06-05 04:24:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 04:24:04,171 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:04,172 INFO L225 Difference]: With dead ends: 264 [2021-06-05 04:24:04,172 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 04:24:04,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2457.6ms TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2021-06-05 04:24:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 04:24:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 176. [2021-06-05 04:24:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.9257142857142857) internal successors, (512), 175 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 512 transitions. [2021-06-05 04:24:04,174 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 512 transitions. Word has length 17 [2021-06-05 04:24:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:04,175 INFO L482 AbstractCegarLoop]: Abstraction has 176 states and 512 transitions. [2021-06-05 04:24:04,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 512 transitions. [2021-06-05 04:24:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:04,175 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:04,175 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:04,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable463 [2021-06-05 04:24:04,376 INFO L430 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1170799304, now seen corresponding path program 3 times [2021-06-05 04:24:04,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:04,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136631264] [2021-06-05 04:24:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:04,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:04,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136631264] [2021-06-05 04:24:04,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136631264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:04,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065401027] [2021-06-05 04:24:04,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:04,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:24:04,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:04,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:04,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:04,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:04,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:04,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:04,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:04,804 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:04,817 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:04,847 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:04,848 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:117 [2021-06-05 04:24:04,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:04,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:04,933 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:04,937 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:04,942 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:04,946 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:24:04,951 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:04,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:04,955 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:04,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:04,959 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:05,047 INFO L628 ElimStorePlain]: treesize reduction 118, result has 53.9 percent of original size [2021-06-05 04:24:05,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:05,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:24:05,051 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:05,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:05,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:05,055 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:05,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:05,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:05,059 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:05,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:24:05,063 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:05,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:05,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:05,108 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:321, output treesize:99 [2021-06-05 04:24:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:05,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065401027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:05,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:05,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:05,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876187473] [2021-06-05 04:24:05,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:05,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:05,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:05,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:05,236 INFO L87 Difference]: Start difference. First operand 176 states and 512 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:06,062 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2021-06-05 04:24:06,302 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 04:24:06,501 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2021-06-05 04:24:06,706 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 04:24:06,926 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-06-05 04:24:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:07,133 INFO L93 Difference]: Finished difference Result 283 states and 795 transitions. [2021-06-05 04:24:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:24:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:07,133 INFO L225 Difference]: With dead ends: 283 [2021-06-05 04:24:07,133 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 04:24:07,134 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1891.4ms TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:24:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 04:24:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2021-06-05 04:24:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.916201117318436) internal successors, (522), 179 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2021-06-05 04:24:07,137 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 17 [2021-06-05 04:24:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:07,137 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2021-06-05 04:24:07,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2021-06-05 04:24:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:07,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:07,138 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:07,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable479 [2021-06-05 04:24:07,338 INFO L430 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 227417012, now seen corresponding path program 4 times [2021-06-05 04:24:07,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:07,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358618920] [2021-06-05 04:24:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:07,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:07,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358618920] [2021-06-05 04:24:07,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358618920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:07,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097745879] [2021-06-05 04:24:07,658 INFO L93 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 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:07,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:24:07,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:07,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:07,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:07,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:07,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:07,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:07,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:07,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:07,880 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:07,986 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2021-06-05 04:24:07,987 INFO L628 ElimStorePlain]: treesize reduction 62, result has 71.6 percent of original size [2021-06-05 04:24:07,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:07,992 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:07,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:07,997 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:08,001 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,082 INFO L628 ElimStorePlain]: treesize reduction 10, result has 92.4 percent of original size [2021-06-05 04:24:08,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:24:08,083 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:245, output treesize:121 [2021-06-05 04:24:08,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:08,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:08,207 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,282 INFO L628 ElimStorePlain]: treesize reduction 71, result has 57.5 percent of original size [2021-06-05 04:24:08,282 INFO L518 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2021-06-05 04:24:08,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:08,286 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:08,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:24:08,320 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:08,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:08,349 INFO L518 ElimStorePlain]: Eliminatee v_prenex_14 vanished before elimination [2021-06-05 04:24:08,349 INFO L518 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2021-06-05 04:24:08,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:24:08,353 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:08,356 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:08,386 INFO L628 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2021-06-05 04:24:08,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:08,392 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:08,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:24:08,396 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:08,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:08,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:08,411 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:197, output treesize:32 [2021-06-05 04:24:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:08,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097745879] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:08,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:08,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:24:08,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596899297] [2021-06-05 04:24:08,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:24:08,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:24:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:24:08,451 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:08,978 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-06-05 04:24:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:09,097 INFO L93 Difference]: Finished difference Result 265 states and 737 transitions. [2021-06-05 04:24:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:24:09,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:09,098 INFO L225 Difference]: With dead ends: 265 [2021-06-05 04:24:09,098 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 04:24:09,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 879.8ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 04:24:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 184. [2021-06-05 04:24:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.907103825136612) internal successors, (532), 183 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2021-06-05 04:24:09,101 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 17 [2021-06-05 04:24:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:09,101 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2021-06-05 04:24:09,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2021-06-05 04:24:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:09,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:09,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:09,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495,151 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:09,305 INFO L430 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:09,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1708654882, now seen corresponding path program 5 times [2021-06-05 04:24:09,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:09,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312066592] [2021-06-05 04:24:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:09,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:09,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312066592] [2021-06-05 04:24:09,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312066592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:09,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145861287] [2021-06-05 04:24:09,494 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:09,520 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:24:09,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:09,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:09,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:09,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:09,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:09,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:09,710 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:09,714 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:09,718 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,818 INFO L628 ElimStorePlain]: treesize reduction 56, result has 74.3 percent of original size [2021-06-05 04:24:09,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:09,823 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:09,827 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:09,831 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:09,872 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:09,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:24:09,874 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:257, output treesize:128 [2021-06-05 04:24:10,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:10,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:10,075 INFO L628 ElimStorePlain]: treesize reduction 55, result has 68.4 percent of original size [2021-06-05 04:24:10,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:10,082 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:10,138 INFO L628 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2021-06-05 04:24:10,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:10,142 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:10,179 INFO L628 ElimStorePlain]: treesize reduction 18, result has 80.2 percent of original size [2021-06-05 04:24:10,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:10,184 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:10,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:10,198 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:10,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:10,201 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:10,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:10,213 INFO L518 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2021-06-05 04:24:10,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:24:10,216 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:10,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:10,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:10,230 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:10,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:10,240 INFO L518 ElimStorePlain]: Eliminatee v_prenex_18 vanished before elimination [2021-06-05 04:24:10,240 INFO L518 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2021-06-05 04:24:10,240 INFO L518 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2021-06-05 04:24:10,241 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:10,241 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:32 [2021-06-05 04:24:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:10,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145861287] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:10,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:10,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:10,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767534058] [2021-06-05 04:24:10,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:10,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:10,275 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:10,752 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2021-06-05 04:24:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:10,944 INFO L93 Difference]: Finished difference Result 279 states and 768 transitions. [2021-06-05 04:24:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:24:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:10,945 INFO L225 Difference]: With dead ends: 279 [2021-06-05 04:24:10,945 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 04:24:10,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 799.7ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 04:24:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2021-06-05 04:24:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.911602209944751) internal successors, (527), 181 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 527 transitions. [2021-06-05 04:24:10,947 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 527 transitions. Word has length 17 [2021-06-05 04:24:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:10,947 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 527 transitions. [2021-06-05 04:24:10,947 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 527 transitions. [2021-06-05 04:24:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:10,947 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:10,947 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:11,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519,152 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:11,148 INFO L430 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1137200076, now seen corresponding path program 6 times [2021-06-05 04:24:11,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:11,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356200203] [2021-06-05 04:24:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:11,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:11,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356200203] [2021-06-05 04:24:11,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356200203] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:11,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640779625] [2021-06-05 04:24:11,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:11,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:24:11,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:11,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:11,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:11,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:11,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:11,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:11,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:11,480 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:11,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:11,485 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:11,489 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:11,521 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:11,521 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:139, output treesize:100 [2021-06-05 04:24:11,653 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_26], 1=[array_4, v_prenex_27]} [2021-06-05 04:24:11,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:11,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:11,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:11,681 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:24:11,686 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,795 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-06-05 04:24:11,795 INFO L628 ElimStorePlain]: treesize reduction 127, result has 55.0 percent of original size [2021-06-05 04:24:11,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:11,799 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:24:11,802 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:11,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:11,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:11,845 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:11,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:11,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:11,849 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:11,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:24:11,855 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:11,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:11,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:11,895 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:11,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:11,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:11,932 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:319, output treesize:102 [2021-06-05 04:24:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:12,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640779625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:12,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:12,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:12,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182385674] [2021-06-05 04:24:12,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:12,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:12,066 INFO L87 Difference]: Start difference. First operand 182 states and 527 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:12,852 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-05 04:24:13,010 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-05 04:24:13,137 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-06-05 04:24:13,320 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2021-06-05 04:24:13,534 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2021-06-05 04:24:13,741 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2021-06-05 04:24:13,982 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-05 04:24:14,215 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2021-06-05 04:24:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:14,291 INFO L93 Difference]: Finished difference Result 416 states and 1139 transitions. [2021-06-05 04:24:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:24:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:14,291 INFO L225 Difference]: With dead ends: 416 [2021-06-05 04:24:14,291 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 04:24:14,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2203.8ms TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2021-06-05 04:24:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 04:24:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2021-06-05 04:24:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.9714285714285715) internal successors, (624), 210 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 624 transitions. [2021-06-05 04:24:14,294 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 624 transitions. Word has length 17 [2021-06-05 04:24:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:14,295 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 624 transitions. [2021-06-05 04:24:14,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 624 transitions. [2021-06-05 04:24:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:14,295 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:14,295 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:14,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:14,496 INFO L430 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1264185258, now seen corresponding path program 7 times [2021-06-05 04:24:14,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:14,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464306899] [2021-06-05 04:24:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:14,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:14,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464306899] [2021-06-05 04:24:14,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464306899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:14,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322986232] [2021-06-05 04:24:14,809 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:14,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:14,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:14,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:14,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:14,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:14,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:14,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:14,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:14,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:14,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:14,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:14,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:14,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:14,953 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:66 [2021-06-05 04:24:15,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:15,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:15,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:15,056 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:15,092 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.5 percent of original size [2021-06-05 04:24:15,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:15,095 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:15,107 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:15,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:15,111 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:15,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:15,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:15,130 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:15,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:15,142 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:15,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:15,145 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:15,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:15,156 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:15,157 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 04:24:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:15,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322986232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:15,190 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:15,190 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:15,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591730757] [2021-06-05 04:24:15,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:15,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:15,190 INFO L87 Difference]: Start difference. First operand 211 states and 624 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:15,719 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-05 04:24:15,902 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 04:24:16,151 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2021-06-05 04:24:16,326 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 04:24:16,520 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2021-06-05 04:24:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:16,600 INFO L93 Difference]: Finished difference Result 341 states and 923 transitions. [2021-06-05 04:24:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:16,601 INFO L225 Difference]: With dead ends: 341 [2021-06-05 04:24:16,601 INFO L226 Difference]: Without dead ends: 316 [2021-06-05 04:24:16,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1450.7ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:24:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-06-05 04:24:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 208. [2021-06-05 04:24:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9855072463768115) internal successors, (618), 207 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2021-06-05 04:24:16,604 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 17 [2021-06-05 04:24:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:16,604 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2021-06-05 04:24:16,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2021-06-05 04:24:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:16,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:16,604 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:16,804 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552,154 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:16,805 INFO L430 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:16,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1508275688, now seen corresponding path program 8 times [2021-06-05 04:24:16,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:16,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269220536] [2021-06-05 04:24:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:17,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:17,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269220536] [2021-06-05 04:24:17,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269220536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:17,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133451090] [2021-06-05 04:24:17,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:17,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:17,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:17,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:17,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:17,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:17,265 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:17,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:17,293 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:17,296 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:17,315 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 04:24:17,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:17,374 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:17,378 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,415 INFO L628 ElimStorePlain]: treesize reduction 39, result has 65.5 percent of original size [2021-06-05 04:24:17,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:24:17,424 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:17,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:17,442 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:17,457 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:17,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:17,472 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:17,482 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:17,483 INFO L518 ElimStorePlain]: Eliminatee v_prenex_37 vanished before elimination [2021-06-05 04:24:17,483 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:17,483 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 04:24:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:17,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133451090] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:17,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:17,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:17,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729010491] [2021-06-05 04:24:17,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:17,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:17,514 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:17,958 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-05 04:24:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:18,162 INFO L93 Difference]: Finished difference Result 298 states and 856 transitions. [2021-06-05 04:24:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:24:18,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:18,163 INFO L225 Difference]: With dead ends: 298 [2021-06-05 04:24:18,163 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 04:24:18,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 810.4ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:24:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 04:24:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 220. [2021-06-05 04:24:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.9680365296803655) internal successors, (650), 219 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 650 transitions. [2021-06-05 04:24:18,165 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 650 transitions. Word has length 17 [2021-06-05 04:24:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:18,166 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 650 transitions. [2021-06-05 04:24:18,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 650 transitions. [2021-06-05 04:24:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:18,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:18,166 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:18,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561,155 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:18,366 INFO L430 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash -27037818, now seen corresponding path program 9 times [2021-06-05 04:24:18,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:18,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332038036] [2021-06-05 04:24:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:18,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:18,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332038036] [2021-06-05 04:24:18,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332038036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:18,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582948255] [2021-06-05 04:24:18,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:18,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:24:18,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:18,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:18,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:18,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:18,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:18,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:18,866 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:18,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:18,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:18,891 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:18,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:18,894 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:18,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:18,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:18,912 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:79 [2021-06-05 04:24:18,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:18,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:18,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:18,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:19,011 INFO L628 ElimStorePlain]: treesize reduction 44, result has 63.6 percent of original size [2021-06-05 04:24:19,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:19,014 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:19,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:19,026 INFO L518 ElimStorePlain]: Eliminatee v_prenex_41 vanished before elimination [2021-06-05 04:24:19,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:19,029 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:19,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:19,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:19,043 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:19,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:19,053 INFO L518 ElimStorePlain]: Eliminatee v_prenex_39 vanished before elimination [2021-06-05 04:24:19,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:19,054 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:135, output treesize:32 [2021-06-05 04:24:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:19,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582948255] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:19,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:19,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:19,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141727700] [2021-06-05 04:24:19,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:19,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:19,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:19,094 INFO L87 Difference]: Start difference. First operand 220 states and 650 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:19,845 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2021-06-05 04:24:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:20,162 INFO L93 Difference]: Finished difference Result 308 states and 858 transitions. [2021-06-05 04:24:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:20,163 INFO L225 Difference]: With dead ends: 308 [2021-06-05 04:24:20,163 INFO L226 Difference]: Without dead ends: 268 [2021-06-05 04:24:20,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1197.9ms TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:24:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-06-05 04:24:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 210. [2021-06-05 04:24:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.971291866028708) internal successors, (621), 209 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 621 transitions. [2021-06-05 04:24:20,166 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 621 transitions. Word has length 17 [2021-06-05 04:24:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:20,167 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 621 transitions. [2021-06-05 04:24:20,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 621 transitions. [2021-06-05 04:24:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:20,167 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:20,167 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:20,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:20,373 INFO L430 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1496339310, now seen corresponding path program 10 times [2021-06-05 04:24:20,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:20,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089064150] [2021-06-05 04:24:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:20,714 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:20,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089064150] [2021-06-05 04:24:20,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089064150] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:20,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826395116] [2021-06-05 04:24:20,714 INFO L93 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 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:20,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:24:20,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:20,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:20,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:20,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:20,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:20,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:20,842 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:20,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:20,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:20,869 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:20,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:20,873 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:20,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:20,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:20,892 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:74 [2021-06-05 04:24:21,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:24:21,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:21,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:21,009 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:21,043 INFO L628 ElimStorePlain]: treesize reduction 10, result has 87.2 percent of original size [2021-06-05 04:24:21,043 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:21,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:21,049 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:21,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:21,063 INFO L518 ElimStorePlain]: Eliminatee v_prenex_46 vanished before elimination [2021-06-05 04:24:21,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:21,066 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:21,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:21,079 INFO L518 ElimStorePlain]: Eliminatee v_prenex_44 vanished before elimination [2021-06-05 04:24:21,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:21,080 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:120, output treesize:32 [2021-06-05 04:24:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:21,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826395116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:21,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:21,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:21,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610252815] [2021-06-05 04:24:21,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:21,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:21,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:21,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:21,120 INFO L87 Difference]: Start difference. First operand 210 states and 621 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:22,241 INFO L93 Difference]: Finished difference Result 379 states and 1063 transitions. [2021-06-05 04:24:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:24:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:22,242 INFO L225 Difference]: With dead ends: 379 [2021-06-05 04:24:22,242 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 04:24:22,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1119.4ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:24:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 04:24:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 221. [2021-06-05 04:24:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.0136363636363637) internal successors, (663), 220 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2021-06-05 04:24:22,245 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 17 [2021-06-05 04:24:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:22,245 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2021-06-05 04:24:22,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2021-06-05 04:24:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:22,245 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:22,245 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:22,446 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 157 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable579 [2021-06-05 04:24:22,446 INFO L430 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:22,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 849561632, now seen corresponding path program 11 times [2021-06-05 04:24:22,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:22,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94238916] [2021-06-05 04:24:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:22,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:22,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94238916] [2021-06-05 04:24:22,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94238916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:22,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132178074] [2021-06-05 04:24:22,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:22,780 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:22,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:22,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 04:24:22,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:22,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:22,894 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:22,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:22,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:22,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:22,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:22,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:22,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:22,933 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:22,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:22,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:22,956 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 04:24:23,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:23,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:23,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:24:23,031 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:23,072 INFO L628 ElimStorePlain]: treesize reduction 39, result has 64.9 percent of original size [2021-06-05 04:24:23,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:23,076 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:23,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:23,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:23,097 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:23,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:23,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:24:23,114 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:23,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:23,129 INFO L518 ElimStorePlain]: Eliminatee v_prenex_51 vanished before elimination [2021-06-05 04:24:23,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:23,133 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:23,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:23,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:23,152 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 04:24:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:23,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132178074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:23,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:23,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:23,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944862931] [2021-06-05 04:24:23,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:23,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:23,192 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:24,087 INFO L93 Difference]: Finished difference Result 288 states and 848 transitions. [2021-06-05 04:24:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:24:24,087 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:24,087 INFO L225 Difference]: With dead ends: 288 [2021-06-05 04:24:24,087 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 04:24:24,087 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 962.8ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:24:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 04:24:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 224. [2021-06-05 04:24:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.013452914798206) internal successors, (672), 223 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 672 transitions. [2021-06-05 04:24:24,091 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 672 transitions. Word has length 17 [2021-06-05 04:24:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:24,091 INFO L482 AbstractCegarLoop]: Abstraction has 224 states and 672 transitions. [2021-06-05 04:24:24,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 672 transitions. [2021-06-05 04:24:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:24,092 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:24,092 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:24,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588,158 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:24,313 INFO L430 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1964167794, now seen corresponding path program 12 times [2021-06-05 04:24:24,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:24,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58059481] [2021-06-05 04:24:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:24,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:24,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58059481] [2021-06-05 04:24:24,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58059481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:24,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274486850] [2021-06-05 04:24:24,611 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:24,645 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:24:24,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:24,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:24,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:24,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:24,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:24,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,796 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:24,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:24,800 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:24,804 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:24,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:24,828 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:77 [2021-06-05 04:24:24,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:24:24,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:24,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,909 INFO L628 ElimStorePlain]: treesize reduction 17, result has 81.5 percent of original size [2021-06-05 04:24:24,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:24,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:24,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:24,926 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:24,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:24,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:24,940 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:24,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:24,951 INFO L518 ElimStorePlain]: Eliminatee v_prenex_56 vanished before elimination [2021-06-05 04:24:24,951 INFO L518 ElimStorePlain]: Eliminatee v_prenex_55 vanished before elimination [2021-06-05 04:24:24,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:24,951 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:32 [2021-06-05 04:24:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:24,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274486850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:24,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:24,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:24:24,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968666681] [2021-06-05 04:24:24,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:24:24,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:24:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:24:24,986 INFO L87 Difference]: Start difference. First operand 224 states and 672 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:25,915 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2021-06-05 04:24:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:26,106 INFO L93 Difference]: Finished difference Result 283 states and 830 transitions. [2021-06-05 04:24:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:24:26,106 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:26,106 INFO L225 Difference]: With dead ends: 283 [2021-06-05 04:24:26,106 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 04:24:26,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1202.5ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:24:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 04:24:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 230. [2021-06-05 04:24:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 3.004366812227074) internal successors, (688), 229 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 688 transitions. [2021-06-05 04:24:26,109 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 688 transitions. Word has length 17 [2021-06-05 04:24:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:26,109 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 688 transitions. [2021-06-05 04:24:26,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 688 transitions. [2021-06-05 04:24:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:26,110 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:26,110 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:26,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable597 [2021-06-05 04:24:26,310 INFO L430 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1308901226, now seen corresponding path program 13 times [2021-06-05 04:24:26,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:26,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385472373] [2021-06-05 04:24:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:26,718 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:26,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385472373] [2021-06-05 04:24:26,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385472373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:26,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305117375] [2021-06-05 04:24:26,718 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:26,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:26,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:26,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:26,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:26,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:26,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:26,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:26,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:26,851 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:26,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:26,855 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:26,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:26,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:26,872 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:60 [2021-06-05 04:24:26,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:26,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:26,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:26,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:27,037 INFO L628 ElimStorePlain]: treesize reduction 60, result has 53.8 percent of original size [2021-06-05 04:24:27,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:27,042 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:27,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:27,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:27,057 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:27,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:27,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:27,071 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:27,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:27,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:24:27,085 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:27,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:27,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:27,099 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:27,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:27,110 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:27,110 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 04:24:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:27,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305117375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:27,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:27,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:27,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778616612] [2021-06-05 04:24:27,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:27,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:27,143 INFO L87 Difference]: Start difference. First operand 230 states and 688 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:27,641 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2021-06-05 04:24:27,879 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 04:24:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:28,072 INFO L93 Difference]: Finished difference Result 361 states and 1046 transitions. [2021-06-05 04:24:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:24:28,072 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:28,072 INFO L225 Difference]: With dead ends: 361 [2021-06-05 04:24:28,072 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 04:24:28,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1109.9ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:24:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 04:24:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2021-06-05 04:24:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0160642570281126) internal successors, (751), 249 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 751 transitions. [2021-06-05 04:24:28,076 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 751 transitions. Word has length 17 [2021-06-05 04:24:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:28,076 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 751 transitions. [2021-06-05 04:24:28,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 751 transitions. [2021-06-05 04:24:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:28,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:28,077 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:28,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606,160 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:28,293 INFO L430 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2024967756, now seen corresponding path program 14 times [2021-06-05 04:24:28,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:28,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434446786] [2021-06-05 04:24:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:28,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:28,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434446786] [2021-06-05 04:24:28,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434446786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:28,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250095571] [2021-06-05 04:24:28,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:28,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:28,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:28,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:28,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:28,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:28,828 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:28,831 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:28,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:28,856 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:28,861 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:28,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:28,880 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 04:24:28,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:28,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:28,947 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,977 INFO L628 ElimStorePlain]: treesize reduction 41, result has 64.0 percent of original size [2021-06-05 04:24:28,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:28,980 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:28,993 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:28,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:28,996 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:29,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:29,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:29,012 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:29,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:29,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:29,027 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:29,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:29,037 INFO L518 ElimStorePlain]: Eliminatee v_prenex_66 vanished before elimination [2021-06-05 04:24:29,038 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:29,038 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 04:24:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:29,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250095571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:29,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:29,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:29,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746579603] [2021-06-05 04:24:29,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:29,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:29,071 INFO L87 Difference]: Start difference. First operand 250 states and 751 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:29,886 INFO L93 Difference]: Finished difference Result 321 states and 954 transitions. [2021-06-05 04:24:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:24:29,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:29,887 INFO L225 Difference]: With dead ends: 321 [2021-06-05 04:24:29,887 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 04:24:29,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1022.2ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:24:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 04:24:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2021-06-05 04:24:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0306513409961684) internal successors, (791), 261 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 791 transitions. [2021-06-05 04:24:29,890 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 791 transitions. Word has length 17 [2021-06-05 04:24:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:29,890 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 791 transitions. [2021-06-05 04:24:29,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 791 transitions. [2021-06-05 04:24:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:29,890 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:29,891 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:30,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable615 [2021-06-05 04:24:30,091 INFO L430 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2098340236, now seen corresponding path program 15 times [2021-06-05 04:24:30,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:30,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589005847] [2021-06-05 04:24:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:30,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:30,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589005847] [2021-06-05 04:24:30,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589005847] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:30,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811209089] [2021-06-05 04:24:30,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:30,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:24:30,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:30,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:30,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:30,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:30,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:30,492 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:30,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:30,528 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:30,532 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,560 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:30,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:30,562 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:115 [2021-06-05 04:24:30,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:30,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:30,650 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:30,655 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:30,659 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:30,663 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:24:30,667 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:30,671 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:30,675 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,763 INFO L628 ElimStorePlain]: treesize reduction 123, result has 51.4 percent of original size [2021-06-05 04:24:30,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:24:30,766 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:30,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:30,770 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:30,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:30,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:30,774 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:30,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:30,778 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:30,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:30,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:30,822 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:94 [2021-06-05 04:24:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:30,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811209089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:30,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:30,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:30,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476166087] [2021-06-05 04:24:30,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:30,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:30,957 INFO L87 Difference]: Start difference. First operand 262 states and 791 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:31,309 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2021-06-05 04:24:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:31,390 INFO L93 Difference]: Finished difference Result 309 states and 924 transitions. [2021-06-05 04:24:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:24:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:31,391 INFO L225 Difference]: With dead ends: 309 [2021-06-05 04:24:31,391 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 04:24:31,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 652.8ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:24:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 04:24:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 263. [2021-06-05 04:24:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.0381679389312977) internal successors, (796), 262 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 796 transitions. [2021-06-05 04:24:31,394 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 796 transitions. Word has length 17 [2021-06-05 04:24:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:31,394 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 796 transitions. [2021-06-05 04:24:31,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 796 transitions. [2021-06-05 04:24:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:31,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:31,395 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:31,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:31,595 INFO L430 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1062058060, now seen corresponding path program 16 times [2021-06-05 04:24:31,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:31,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894053166] [2021-06-05 04:24:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:31,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:31,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894053166] [2021-06-05 04:24:31,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894053166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:31,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974371426] [2021-06-05 04:24:31,933 INFO L93 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 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:31,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:24:31,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:31,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:31,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:32,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:32,059 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:32,062 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:32,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:32,085 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:32,088 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:32,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:32,106 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 04:24:32,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:32,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:24:32,186 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,220 INFO L628 ElimStorePlain]: treesize reduction 31, result has 67.4 percent of original size [2021-06-05 04:24:32,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:32,222 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:32,234 INFO L518 ElimStorePlain]: Eliminatee v_prenex_70 vanished before elimination [2021-06-05 04:24:32,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:32,237 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:32,247 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:32,247 INFO L518 ElimStorePlain]: Eliminatee v_prenex_73 vanished before elimination [2021-06-05 04:24:32,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:32,250 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:32,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:32,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:32,261 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 04:24:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:32,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974371426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:32,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:32,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:32,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952196216] [2021-06-05 04:24:32,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:32,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:32,294 INFO L87 Difference]: Start difference. First operand 263 states and 796 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:32,802 INFO L93 Difference]: Finished difference Result 315 states and 940 transitions. [2021-06-05 04:24:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:24:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:32,803 INFO L225 Difference]: With dead ends: 315 [2021-06-05 04:24:32,803 INFO L226 Difference]: Without dead ends: 305 [2021-06-05 04:24:32,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 695.7ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:24:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-06-05 04:24:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 265. [2021-06-05 04:24:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.0416666666666665) internal successors, (803), 264 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 803 transitions. [2021-06-05 04:24:32,806 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 803 transitions. Word has length 17 [2021-06-05 04:24:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:32,806 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 803 transitions. [2021-06-05 04:24:32,806 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 803 transitions. [2021-06-05 04:24:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:32,806 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:32,806 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:33,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 163 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable642 [2021-06-05 04:24:33,007 INFO L430 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 419179810, now seen corresponding path program 17 times [2021-06-05 04:24:33,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:33,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804450988] [2021-06-05 04:24:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:33,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:33,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804450988] [2021-06-05 04:24:33,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804450988] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:33,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913461450] [2021-06-05 04:24:33,247 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:33,280 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:24:33,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:33,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 04:24:33,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:33,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:33,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:33,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:33,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:33,413 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:33,417 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:33,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:33,440 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:83 [2021-06-05 04:24:33,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:33,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,526 INFO L628 ElimStorePlain]: treesize reduction 30, result has 69.7 percent of original size [2021-06-05 04:24:33,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:33,529 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:33,541 INFO L518 ElimStorePlain]: Eliminatee v_prenex_75 vanished before elimination [2021-06-05 04:24:33,541 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:33,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:33,544 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:33,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:33,554 INFO L518 ElimStorePlain]: Eliminatee v_prenex_77 vanished before elimination [2021-06-05 04:24:33,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:33,555 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:118, output treesize:32 [2021-06-05 04:24:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:33,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913461450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:33,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:33,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:24:33,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071407528] [2021-06-05 04:24:33,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:24:33,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:24:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:24:33,590 INFO L87 Difference]: Start difference. First operand 265 states and 803 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:33,992 INFO L93 Difference]: Finished difference Result 313 states and 936 transitions. [2021-06-05 04:24:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:24:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:33,993 INFO L225 Difference]: With dead ends: 313 [2021-06-05 04:24:33,993 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 04:24:33,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 526.3ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:24:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 04:24:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2021-06-05 04:24:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 3.0483271375464684) internal successors, (820), 269 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 820 transitions. [2021-06-05 04:24:33,995 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 820 transitions. Word has length 17 [2021-06-05 04:24:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:33,995 INFO L482 AbstractCegarLoop]: Abstraction has 270 states and 820 transitions. [2021-06-05 04:24:33,995 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 820 transitions. [2021-06-05 04:24:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:33,996 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:33,996 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:34,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable651 [2021-06-05 04:24:34,196 INFO L430 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:34,197 INFO L82 PathProgramCache]: Analyzing trace with hash 968096220, now seen corresponding path program 18 times [2021-06-05 04:24:34,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:34,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022807046] [2021-06-05 04:24:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:34,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:34,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022807046] [2021-06-05 04:24:34,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022807046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:34,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655564441] [2021-06-05 04:24:34,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:34,785 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:24:34,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:34,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 04:24:34,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:34,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:34,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:34,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:34,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:34,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:34,902 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:34,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:34,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:34,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:34,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:34,916 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:34,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:34,962 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:34,962 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:147 [2021-06-05 04:24:35,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:35,142 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:35,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:35,146 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:35,202 INFO L628 ElimStorePlain]: treesize reduction 72, result has 61.1 percent of original size [2021-06-05 04:24:35,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:35,206 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:35,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:35,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:24:35,234 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:35,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:35,236 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:35,271 INFO L628 ElimStorePlain]: treesize reduction 9, result has 90.5 percent of original size [2021-06-05 04:24:35,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:35,274 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:35,297 INFO L628 ElimStorePlain]: treesize reduction 24, result has 65.2 percent of original size [2021-06-05 04:24:35,297 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:35,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:35,300 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:35,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:35,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:35,311 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:196, output treesize:32 [2021-06-05 04:24:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:35,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655564441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:35,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:35,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:24:35,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079709021] [2021-06-05 04:24:35,355 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:24:35,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:24:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:24:35,356 INFO L87 Difference]: Start difference. First operand 270 states and 820 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:35,792 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2021-06-05 04:24:36,009 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2021-06-05 04:24:36,267 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 04:24:36,516 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2021-06-05 04:24:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:36,581 INFO L93 Difference]: Finished difference Result 319 states and 954 transitions. [2021-06-05 04:24:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:24:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:36,582 INFO L225 Difference]: With dead ends: 319 [2021-06-05 04:24:36,582 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 04:24:36,582 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1657.1ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 04:24:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 272. [2021-06-05 04:24:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.047970479704797) internal successors, (826), 271 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 04:24:36,585 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 17 [2021-06-05 04:24:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:36,585 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 04:24:36,585 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 04:24:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:36,586 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:36,586 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:36,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660,165 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:36,786 INFO L430 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash 153290066, now seen corresponding path program 19 times [2021-06-05 04:24:36,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:36,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902849137] [2021-06-05 04:24:36,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:37,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:37,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902849137] [2021-06-05 04:24:37,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902849137] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:37,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63944730] [2021-06-05 04:24:37,186 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:37,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:37,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:37,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:37,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:37,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,548 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 04:24:37,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:37,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:37,555 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:37,561 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,714 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-06-05 04:24:37,714 INFO L628 ElimStorePlain]: treesize reduction 63, result has 77.3 percent of original size [2021-06-05 04:24:37,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:37,720 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:37,725 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,852 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 04:24:37,853 INFO L628 ElimStorePlain]: treesize reduction 4, result has 98.0 percent of original size [2021-06-05 04:24:37,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:37,857 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,942 INFO L628 ElimStorePlain]: treesize reduction 50, result has 73.1 percent of original size [2021-06-05 04:24:37,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:37,945 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:37,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:37,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:24:37,978 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:312, output treesize:129 [2021-06-05 04:24:38,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:38,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:38,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:38,081 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:38,170 INFO L628 ElimStorePlain]: treesize reduction 48, result has 75.8 percent of original size [2021-06-05 04:24:38,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:38,176 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:38,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:38,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:38,221 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:38,281 INFO L628 ElimStorePlain]: treesize reduction 37, result has 73.8 percent of original size [2021-06-05 04:24:38,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:38,285 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:38,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:24:38,289 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:38,318 INFO L628 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2021-06-05 04:24:38,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:24:38,322 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:38,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:38,336 INFO L518 ElimStorePlain]: Eliminatee v_prenex_89 vanished before elimination [2021-06-05 04:24:38,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:24:38,340 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:38,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:38,354 INFO L518 ElimStorePlain]: Eliminatee v_prenex_90 vanished before elimination [2021-06-05 04:24:38,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:38,355 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:211, output treesize:32 [2021-06-05 04:24:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:38,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63944730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:38,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:38,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:24:38,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377576082] [2021-06-05 04:24:38,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:24:38,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:24:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:24:38,401 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:38,969 INFO L93 Difference]: Finished difference Result 323 states and 962 transitions. [2021-06-05 04:24:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:38,969 INFO L225 Difference]: With dead ends: 323 [2021-06-05 04:24:38,969 INFO L226 Difference]: Without dead ends: 312 [2021-06-05 04:24:38,970 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 882.9ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-06-05 04:24:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2021-06-05 04:24:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.0709219858156027) internal successors, (866), 282 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 866 transitions. [2021-06-05 04:24:38,973 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 866 transitions. Word has length 17 [2021-06-05 04:24:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:38,973 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 866 transitions. [2021-06-05 04:24:38,973 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 866 transitions. [2021-06-05 04:24:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:38,973 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:38,973 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:39,174 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable674 [2021-06-05 04:24:39,174 INFO L430 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:39,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1175189202, now seen corresponding path program 20 times [2021-06-05 04:24:39,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:39,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807909884] [2021-06-05 04:24:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:39,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:39,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807909884] [2021-06-05 04:24:39,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807909884] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:39,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352274344] [2021-06-05 04:24:39,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:39,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:39,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:39,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:39,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:39,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:39,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:39,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:39,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:39,658 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:39,662 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:39,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:39,699 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:150, output treesize:119 [2021-06-05 04:24:39,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:39,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:39,782 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:39,786 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:39,791 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:39,795 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:24:39,799 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:39,803 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:39,807 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,896 INFO L628 ElimStorePlain]: treesize reduction 126, result has 50.8 percent of original size [2021-06-05 04:24:39,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:39,900 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:39,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:39,904 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:39,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:39,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:24:39,908 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:39,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:39,911 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:39,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:39,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:39,948 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:325, output treesize:97 [2021-06-05 04:24:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:40,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352274344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:40,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:40,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:40,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727260600] [2021-06-05 04:24:40,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:40,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:40,094 INFO L87 Difference]: Start difference. First operand 283 states and 866 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:40,514 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-06-05 04:24:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:40,602 INFO L93 Difference]: Finished difference Result 328 states and 991 transitions. [2021-06-05 04:24:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:24:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:40,602 INFO L225 Difference]: With dead ends: 328 [2021-06-05 04:24:40,602 INFO L226 Difference]: Without dead ends: 318 [2021-06-05 04:24:40,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 743.2ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:24:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-06-05 04:24:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2021-06-05 04:24:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.0704225352112675) internal successors, (872), 284 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 04:24:40,605 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 04:24:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:40,606 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 04:24:40,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 04:24:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:40,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:40,606 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:40,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713,167 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:40,807 INFO L430 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:40,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1517772714, now seen corresponding path program 21 times [2021-06-05 04:24:40,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:40,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525595504] [2021-06-05 04:24:40,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:41,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:41,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525595504] [2021-06-05 04:24:41,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525595504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:41,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388476292] [2021-06-05 04:24:41,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:41,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 04:24:41,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:41,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:41,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:41,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:41,210 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:41,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:41,245 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:41,249 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:41,271 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:70 [2021-06-05 04:24:41,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:41,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:41,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,382 INFO L628 ElimStorePlain]: treesize reduction 60, result has 52.8 percent of original size [2021-06-05 04:24:41,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:41,386 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:41,406 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:41,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:41,426 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:41,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:41,444 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:41,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:41,462 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:41,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:41,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:41,476 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 04:24:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:41,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388476292] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:41,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:41,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:24:41,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298420376] [2021-06-05 04:24:41,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:24:41,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:41,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:24:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:24:41,516 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:41,924 INFO L93 Difference]: Finished difference Result 326 states and 985 transitions. [2021-06-05 04:24:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:24:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:41,925 INFO L225 Difference]: With dead ends: 326 [2021-06-05 04:24:41,925 INFO L226 Difference]: Without dead ends: 315 [2021-06-05 04:24:41,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 570.7ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:24:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-06-05 04:24:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 285. [2021-06-05 04:24:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.0704225352112675) internal successors, (872), 284 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 04:24:41,928 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 04:24:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:41,928 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 04:24:41,928 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 04:24:41,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:41,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:41,929 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:42,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731,168 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:42,129 INFO L430 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1096748704, now seen corresponding path program 22 times [2021-06-05 04:24:42,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:42,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582436046] [2021-06-05 04:24:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:42,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:42,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582436046] [2021-06-05 04:24:42,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582436046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:42,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265063923] [2021-06-05 04:24:42,406 INFO L93 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 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:42,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:24:42,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:42,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:42,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:42,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:42,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:42,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:42,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:42,551 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:42,554 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:42,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:42,574 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 04:24:42,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:24:42,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:42,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,663 INFO L628 ElimStorePlain]: treesize reduction 31, result has 67.4 percent of original size [2021-06-05 04:24:42,663 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:42,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:42,666 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:42,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:42,681 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:42,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:42,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:42,696 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:42,706 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:42,706 INFO L518 ElimStorePlain]: Eliminatee v_prenex_103 vanished before elimination [2021-06-05 04:24:42,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:42,707 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 04:24:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:42,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265063923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:42,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:42,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:42,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9356632] [2021-06-05 04:24:42,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:42,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:42,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:42,739 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:43,622 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 66 [2021-06-05 04:24:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:43,818 INFO L93 Difference]: Finished difference Result 361 states and 1073 transitions. [2021-06-05 04:24:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:24:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:43,819 INFO L225 Difference]: With dead ends: 361 [2021-06-05 04:24:43,819 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 04:24:43,819 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1141.2ms TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:24:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 04:24:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 296. [2021-06-05 04:24:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.08135593220339) internal successors, (909), 295 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 909 transitions. [2021-06-05 04:24:43,823 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 909 transitions. Word has length 17 [2021-06-05 04:24:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:43,824 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 909 transitions. [2021-06-05 04:24:43,824 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 909 transitions. [2021-06-05 04:24:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:43,824 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:43,824 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:44,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable740 [2021-06-05 04:24:44,046 INFO L430 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:44,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1716980722, now seen corresponding path program 23 times [2021-06-05 04:24:44,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:44,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629143171] [2021-06-05 04:24:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:44,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:44,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629143171] [2021-06-05 04:24:44,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629143171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:44,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694059368] [2021-06-05 04:24:44,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:44,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:24:44,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:44,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:44,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:44,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:44,527 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:44,534 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,678 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-06-05 04:24:44,679 INFO L628 ElimStorePlain]: treesize reduction 65, result has 78.4 percent of original size [2021-06-05 04:24:44,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:44,683 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,767 INFO L628 ElimStorePlain]: treesize reduction 70, result has 68.9 percent of original size [2021-06-05 04:24:44,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:44,771 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:44,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:44,809 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:44,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:44,847 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:44,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:44,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:24:44,880 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:322, output treesize:134 [2021-06-05 04:24:45,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:45,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:45,075 INFO L628 ElimStorePlain]: treesize reduction 67, result has 67.0 percent of original size [2021-06-05 04:24:45,075 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:45,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_110 vanished before elimination [2021-06-05 04:24:45,075 INFO L518 ElimStorePlain]: Eliminatee v_prenex_111 vanished before elimination [2021-06-05 04:24:45,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:45,082 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:45,126 INFO L628 ElimStorePlain]: treesize reduction 37, result has 68.4 percent of original size [2021-06-05 04:24:45,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_113 vanished before elimination [2021-06-05 04:24:45,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_114 vanished before elimination [2021-06-05 04:24:45,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_115 vanished before elimination [2021-06-05 04:24:45,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_116 vanished before elimination [2021-06-05 04:24:45,127 INFO L518 ElimStorePlain]: Eliminatee v_prenex_117 vanished before elimination [2021-06-05 04:24:45,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:45,130 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:45,157 INFO L628 ElimStorePlain]: treesize reduction 18, result has 75.0 percent of original size [2021-06-05 04:24:45,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:45,160 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:45,173 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:45,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:45,175 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:45,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:45,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:45,189 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:45,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:45,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 14 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:45,200 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 14 variables, input treesize:221, output treesize:32 [2021-06-05 04:24:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:45,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694059368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:45,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:45,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:45,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111026270] [2021-06-05 04:24:45,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:45,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:45,235 INFO L87 Difference]: Start difference. First operand 296 states and 909 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:45,786 INFO L93 Difference]: Finished difference Result 340 states and 1019 transitions. [2021-06-05 04:24:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:45,786 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:45,787 INFO L225 Difference]: With dead ends: 340 [2021-06-05 04:24:45,787 INFO L226 Difference]: Without dead ends: 332 [2021-06-05 04:24:45,787 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 730.5ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-06-05 04:24:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2021-06-05 04:24:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 04:24:45,790 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 04:24:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:45,790 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 04:24:45,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 04:24:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:45,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:45,791 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:45,991 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749,170 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:45,991 INFO L430 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2006531768, now seen corresponding path program 24 times [2021-06-05 04:24:45,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:45,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426314129] [2021-06-05 04:24:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:46,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:46,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426314129] [2021-06-05 04:24:46,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426314129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:46,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891755215] [2021-06-05 04:24:46,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:46,306 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:24:46,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:46,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:46,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:46,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:46,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:46,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:46,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:46,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:46,467 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:46,470 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:46,473 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:46,501 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:24:46,501 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:161, output treesize:112 [2021-06-05 04:24:46,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:46,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:46,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,719 INFO L628 ElimStorePlain]: treesize reduction 84, result has 55.3 percent of original size [2021-06-05 04:24:46,720 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:24:46,720 INFO L518 ElimStorePlain]: Eliminatee v_prenex_121 vanished before elimination [2021-06-05 04:24:46,720 INFO L518 ElimStorePlain]: Eliminatee v_prenex_122 vanished before elimination [2021-06-05 04:24:46,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:46,723 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:46,726 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,752 INFO L628 ElimStorePlain]: treesize reduction 20, result has 74.4 percent of original size [2021-06-05 04:24:46,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:46,755 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:46,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:46,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:46,769 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:46,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:46,780 INFO L518 ElimStorePlain]: Eliminatee v_prenex_126 vanished before elimination [2021-06-05 04:24:46,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:46,780 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:218, output treesize:32 [2021-06-05 04:24:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:46,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891755215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:46,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:46,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:46,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062450964] [2021-06-05 04:24:46,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:46,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:46,823 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:47,456 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2021-06-05 04:24:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:47,655 INFO L93 Difference]: Finished difference Result 382 states and 1120 transitions. [2021-06-05 04:24:47,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:47,656 INFO L225 Difference]: With dead ends: 382 [2021-06-05 04:24:47,656 INFO L226 Difference]: Without dead ends: 372 [2021-06-05 04:24:47,656 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 951.9ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:24:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-06-05 04:24:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 298. [2021-06-05 04:24:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 04:24:47,659 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 04:24:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:47,660 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 04:24:47,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 04:24:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:47,660 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:47,660 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:47,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable779 [2021-06-05 04:24:47,865 INFO L430 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1520655850, now seen corresponding path program 25 times [2021-06-05 04:24:47,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:47,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722128520] [2021-06-05 04:24:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:48,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:48,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722128520] [2021-06-05 04:24:48,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722128520] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:48,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741370475] [2021-06-05 04:24:48,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:48,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:48,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:48,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:48,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:48,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:48,242 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:48,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:48,262 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:69 [2021-06-05 04:24:48,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:48,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:48,318 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,362 INFO L628 ElimStorePlain]: treesize reduction 61, result has 52.7 percent of original size [2021-06-05 04:24:48,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:48,366 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:24:48,383 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:48,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:48,397 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:48,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:48,411 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:48,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:24:48,425 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:48,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:48,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:48,437 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:140, output treesize:32 [2021-06-05 04:24:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:48,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741370475] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:48,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:48,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:24:48,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689271655] [2021-06-05 04:24:48,472 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:24:48,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:24:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:24:48,473 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:49,135 INFO L93 Difference]: Finished difference Result 372 states and 1109 transitions. [2021-06-05 04:24:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:24:49,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:49,136 INFO L225 Difference]: With dead ends: 372 [2021-06-05 04:24:49,136 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 04:24:49,136 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 700.6ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:24:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 04:24:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 297. [2021-06-05 04:24:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.0878378378378377) internal successors, (914), 296 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 914 transitions. [2021-06-05 04:24:49,139 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 914 transitions. Word has length 17 [2021-06-05 04:24:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:49,139 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 914 transitions. [2021-06-05 04:24:49,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 914 transitions. [2021-06-05 04:24:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:49,140 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:49,140 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:49,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:49,340 INFO L430 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1001716564, now seen corresponding path program 26 times [2021-06-05 04:24:49,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:49,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745057484] [2021-06-05 04:24:49,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:49,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:49,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745057484] [2021-06-05 04:24:49,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745057484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:49,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489275595] [2021-06-05 04:24:49,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:49,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:24:49,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:49,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:49,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:49,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:49,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:49,892 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:49,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:49,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:49,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:49,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:49,913 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:49,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:49,927 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:49,927 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:66 [2021-06-05 04:24:50,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:24:50,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:50,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:50,016 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:50,043 INFO L628 ElimStorePlain]: treesize reduction 17, result has 81.5 percent of original size [2021-06-05 04:24:50,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:50,047 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:50,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:50,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:50,063 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:50,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:50,074 INFO L518 ElimStorePlain]: Eliminatee v_prenex_134 vanished before elimination [2021-06-05 04:24:50,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:50,077 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:50,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:50,087 INFO L518 ElimStorePlain]: Eliminatee v_prenex_136 vanished before elimination [2021-06-05 04:24:50,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:50,088 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:32 [2021-06-05 04:24:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:50,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489275595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:50,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:50,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:50,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185650989] [2021-06-05 04:24:50,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:50,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:50,125 INFO L87 Difference]: Start difference. First operand 297 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:50,882 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-06-05 04:24:51,183 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-06-05 04:24:51,344 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2021-06-05 04:24:51,556 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2021-06-05 04:24:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:51,662 INFO L93 Difference]: Finished difference Result 447 states and 1309 transitions. [2021-06-05 04:24:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:24:51,662 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:51,663 INFO L225 Difference]: With dead ends: 447 [2021-06-05 04:24:51,663 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 04:24:51,663 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1635.9ms TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:24:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 04:24:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 298. [2021-06-05 04:24:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0942760942760943) internal successors, (919), 297 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 919 transitions. [2021-06-05 04:24:51,666 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 919 transitions. Word has length 17 [2021-06-05 04:24:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:51,666 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 919 transitions. [2021-06-05 04:24:51,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 919 transitions. [2021-06-05 04:24:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:51,667 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:51,667 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:51,867 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813,173 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:51,868 INFO L430 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1965452058, now seen corresponding path program 27 times [2021-06-05 04:24:51,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:51,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279063] [2021-06-05 04:24:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:52,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:52,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279063] [2021-06-05 04:24:52,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279063] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:52,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377044741] [2021-06-05 04:24:52,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:52,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:24:52,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:52,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:52,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:52,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:52,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:52,384 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:52,414 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:52,417 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:52,441 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 04:24:52,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:24:52,513 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:52,519 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,564 INFO L628 ElimStorePlain]: treesize reduction 54, result has 52.6 percent of original size [2021-06-05 04:24:52,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:52,568 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,584 INFO L518 ElimStorePlain]: Eliminatee v_prenex_141 vanished before elimination [2021-06-05 04:24:52,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:52,588 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:52,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:52,607 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:52,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:52,620 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:52,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:52,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:52,631 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 04:24:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:52,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377044741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:52,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:52,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:52,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244282944] [2021-06-05 04:24:52,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:52,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:52,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:52,664 INFO L87 Difference]: Start difference. First operand 298 states and 919 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:53,219 INFO L93 Difference]: Finished difference Result 352 states and 1066 transitions. [2021-06-05 04:24:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:24:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:53,220 INFO L225 Difference]: With dead ends: 352 [2021-06-05 04:24:53,220 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 04:24:53,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 759.3ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:24:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 04:24:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 300. [2021-06-05 04:24:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.096989966555184) internal successors, (926), 299 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 926 transitions. [2021-06-05 04:24:53,223 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 926 transitions. Word has length 17 [2021-06-05 04:24:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:53,223 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 926 transitions. [2021-06-05 04:24:53,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 926 transitions. [2021-06-05 04:24:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:53,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:53,223 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:53,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:53,424 INFO L430 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash -848277368, now seen corresponding path program 28 times [2021-06-05 04:24:53,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:53,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268869099] [2021-06-05 04:24:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:53,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:53,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268869099] [2021-06-05 04:24:53,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268869099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:53,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86345455] [2021-06-05 04:24:53,646 INFO L93 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 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:53,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:24:53,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:53,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:53,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:53,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:53,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:53,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:53,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:53,815 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:53,818 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:53,848 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:53,848 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:121 [2021-06-05 04:24:53,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:53,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:53,931 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:24:53,935 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:53,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:53,943 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:53,949 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:53,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:24:53,954 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:53,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:53,959 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:54,049 INFO L628 ElimStorePlain]: treesize reduction 126, result has 51.4 percent of original size [2021-06-05 04:24:54,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:54,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:54,055 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:54,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:54,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:24:54,058 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:54,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:54,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:54,062 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:54,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:54,066 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:54,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:54,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:54,102 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:329, output treesize:97 [2021-06-05 04:24:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:54,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86345455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:54,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:54,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:54,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149404128] [2021-06-05 04:24:54,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:54,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:54,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:54,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:54,237 INFO L87 Difference]: Start difference. First operand 300 states and 926 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:54,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:54,728 INFO L93 Difference]: Finished difference Result 350 states and 1062 transitions. [2021-06-05 04:24:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:24:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:54,729 INFO L225 Difference]: With dead ends: 350 [2021-06-05 04:24:54,729 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 04:24:54,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 601.6ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:24:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 04:24:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2021-06-05 04:24:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0939597315436242) internal successors, (922), 298 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 922 transitions. [2021-06-05 04:24:54,732 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 922 transitions. Word has length 17 [2021-06-05 04:24:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:54,733 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 922 transitions. [2021-06-05 04:24:54,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 922 transitions. [2021-06-05 04:24:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:54,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:54,733 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:54,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 175 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable831 [2021-06-05 04:24:54,934 INFO L430 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -299360958, now seen corresponding path program 29 times [2021-06-05 04:24:54,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:54,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300048643] [2021-06-05 04:24:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:55,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:55,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300048643] [2021-06-05 04:24:55,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300048643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:55,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235375903] [2021-06-05 04:24:55,440 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:55,466 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:24:55,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:55,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:24:55,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:55,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:55,565 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:55,570 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:55,594 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:55,597 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:55,615 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 04:24:55,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:55,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:55,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,711 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.9 percent of original size [2021-06-05 04:24:55,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:55,715 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:55,728 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:55,731 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,743 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:55,746 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:55,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:55,760 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:55,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:55,771 INFO L518 ElimStorePlain]: Eliminatee v_prenex_147 vanished before elimination [2021-06-05 04:24:55,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:55,771 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 04:24:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:55,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235375903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:55,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:55,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:24:55,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810816281] [2021-06-05 04:24:55,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:55,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:55,805 INFO L87 Difference]: Start difference. First operand 299 states and 922 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:56,330 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2021-06-05 04:24:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:56,427 INFO L93 Difference]: Finished difference Result 349 states and 1060 transitions. [2021-06-05 04:24:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:24:56,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:56,428 INFO L225 Difference]: With dead ends: 349 [2021-06-05 04:24:56,428 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 04:24:56,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 926.6ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:24:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 04:24:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 301. [2021-06-05 04:24:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 04:24:56,431 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 04:24:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:56,431 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 04:24:56,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 04:24:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:56,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:56,432 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:56,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849,176 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:56,637 INFO L430 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:56,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1114167112, now seen corresponding path program 30 times [2021-06-05 04:24:56,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:56,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244578863] [2021-06-05 04:24:56,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:56,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:56,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244578863] [2021-06-05 04:24:56,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244578863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:56,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013699579] [2021-06-05 04:24:56,953 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:56,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:24:56,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:24:56,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:56,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:57,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:57,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:57,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:57,114 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:57,117 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:57,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:57,146 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:115 [2021-06-05 04:24:57,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:57,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:57,228 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:24:57,232 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:57,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:57,240 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:24:57,244 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:57,248 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:57,251 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,341 INFO L628 ElimStorePlain]: treesize reduction 119, result has 52.2 percent of original size [2021-06-05 04:24:57,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:57,346 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:57,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:24:57,350 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:57,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:57,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:57,354 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:57,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:24:57,357 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:57,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:57,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:24:57,396 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:94 [2021-06-05 04:24:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:57,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013699579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:57,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:57,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 04:24:57,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033494097] [2021-06-05 04:24:57,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:24:57,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:57,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:24:57,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:24:57,513 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:57,941 INFO L93 Difference]: Finished difference Result 363 states and 1106 transitions. [2021-06-05 04:24:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:24:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:57,942 INFO L225 Difference]: With dead ends: 363 [2021-06-05 04:24:57,942 INFO L226 Difference]: Without dead ends: 352 [2021-06-05 04:24:57,942 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 675.7ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:24:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-06-05 04:24:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 301. [2021-06-05 04:24:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 04:24:57,947 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 04:24:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:57,947 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 04:24:57,947 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 04:24:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:57,947 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:57,948 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:58,153 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858,177 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:58,154 INFO L430 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash -92267976, now seen corresponding path program 31 times [2021-06-05 04:24:58,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:58,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229515185] [2021-06-05 04:24:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:58,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:24:58,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229515185] [2021-06-05 04:24:58,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229515185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:58,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322924762] [2021-06-05 04:24:58,485 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:24:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:24:58,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:24:58,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:24:58,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:58,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:58,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:58,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:24:58,600 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:24:58,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:58,604 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:24:58,609 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:58,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:58,654 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:132 [2021-06-05 04:24:58,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:24:58,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:24:58,817 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,867 INFO L628 ElimStorePlain]: treesize reduction 14, result has 88.7 percent of original size [2021-06-05 04:24:58,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:24:58,870 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:24:58,873 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,908 INFO L628 ElimStorePlain]: treesize reduction 11, result has 89.3 percent of original size [2021-06-05 04:24:58,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:24:58,910 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:24:58,933 INFO L628 ElimStorePlain]: treesize reduction 14, result has 80.8 percent of original size [2021-06-05 04:24:58,934 INFO L518 ElimStorePlain]: Eliminatee v_prenex_152 vanished before elimination [2021-06-05 04:24:58,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:24:58,936 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:58,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:58,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:24:58,950 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:58,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:24:58,953 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:24:58,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:24:58,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:24:58,964 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:138, output treesize:32 [2021-06-05 04:24:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:24:59,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322924762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:24:59,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:24:59,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:24:59,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715590426] [2021-06-05 04:24:59,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:24:59,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:24:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:24:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:24:59,006 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:59,275 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2021-06-05 04:24:59,488 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2021-06-05 04:24:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:24:59,558 INFO L93 Difference]: Finished difference Result 350 states and 1067 transitions. [2021-06-05 04:24:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:24:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:24:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:24:59,559 INFO L225 Difference]: With dead ends: 350 [2021-06-05 04:24:59,559 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 04:24:59,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 850.4ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:24:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 04:24:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 303. [2021-06-05 04:24:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 04:24:59,562 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 04:24:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:24:59,562 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 04:24:59,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:24:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 04:24:59,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:24:59,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:24:59,563 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:24:59,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 178 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable876 [2021-06-05 04:24:59,763 INFO L430 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:24:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:24:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 250315536, now seen corresponding path program 32 times [2021-06-05 04:24:59,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:24:59,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84557640] [2021-06-05 04:24:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:24:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:00,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:00,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84557640] [2021-06-05 04:25:00,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84557640] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:00,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634928107] [2021-06-05 04:25:00,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:00,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:00,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:00,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:00,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:00,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:00,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:00,103 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:00,127 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:00,130 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:00,148 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:70 [2021-06-05 04:25:00,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:00,203 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:00,206 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,238 INFO L628 ElimStorePlain]: treesize reduction 62, result has 53.0 percent of original size [2021-06-05 04:25:00,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:25:00,241 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:00,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:00,257 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:25:00,272 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:00,284 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:00,287 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:00,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:00,300 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:00,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:00,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:00,311 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 04:25:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:00,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634928107] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:00,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:00,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:25:00,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923594554] [2021-06-05 04:25:00,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:00,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:00,349 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:00,773 INFO L93 Difference]: Finished difference Result 348 states and 1061 transitions. [2021-06-05 04:25:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:25:00,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:00,774 INFO L225 Difference]: With dead ends: 348 [2021-06-05 04:25:00,774 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 04:25:00,774 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 508.2ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:25:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 04:25:00,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 301. [2021-06-05 04:25:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 04:25:00,777 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 04:25:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:00,777 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 04:25:00,777 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 04:25:00,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:00,777 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:00,777 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:00,978 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890,179 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:00,978 INFO L430 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:00,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:00,978 INFO L82 PathProgramCache]: Analyzing trace with hash -326980856, now seen corresponding path program 33 times [2021-06-05 04:25:00,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:00,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066889702] [2021-06-05 04:25:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:01,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:01,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066889702] [2021-06-05 04:25:01,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066889702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:01,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372855374] [2021-06-05 04:25:01,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:01,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:25:01,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:01,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 04:25:01,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:01,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:01,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:01,386 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:01,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:01,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,392 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:01,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:01,393 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:01,396 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:01,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:01,437 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:132 [2021-06-05 04:25:01,588 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_158], 1=[array_4, v_prenex_159]} [2021-06-05 04:25:01,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:25:01,593 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:01,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:01,601 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:01,605 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,721 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 04:25:01,721 INFO L628 ElimStorePlain]: treesize reduction 149, result has 53.6 percent of original size [2021-06-05 04:25:01,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:25:01,731 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:01,736 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:01,740 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:01,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:01,801 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:01,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:01,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:01,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:01,850 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:01,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:01,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:01,854 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:01,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:25:01,857 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:01,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:01,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:01,900 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:359, output treesize:113 [2021-06-05 04:25:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:02,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372855374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:02,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:02,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:25:02,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935020532] [2021-06-05 04:25:02,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:02,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:02,025 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:02,337 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2021-06-05 04:25:02,513 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2021-06-05 04:25:02,693 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2021-06-05 04:25:02,919 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2021-06-05 04:25:03,154 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-06-05 04:25:03,398 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-06-05 04:25:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:03,480 INFO L93 Difference]: Finished difference Result 407 states and 1230 transitions. [2021-06-05 04:25:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:25:03,481 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:03,481 INFO L225 Difference]: With dead ends: 407 [2021-06-05 04:25:03,481 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 04:25:03,482 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1664.2ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:25:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 04:25:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 303. [2021-06-05 04:25:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 04:25:03,485 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 04:25:03,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:03,485 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 04:25:03,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 04:25:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:03,485 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:03,486 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:03,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:03,686 INFO L430 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 947967822, now seen corresponding path program 34 times [2021-06-05 04:25:03,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:03,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136397119] [2021-06-05 04:25:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:04,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:04,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136397119] [2021-06-05 04:25:04,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136397119] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:04,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591959556] [2021-06-05 04:25:04,034 INFO L93 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 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:04,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:25:04,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:04,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:04,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:04,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:04,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:04,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:04,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:04,165 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:04,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:04,169 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:04,173 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:04,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:04,214 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:128 [2021-06-05 04:25:04,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:25:04,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:25:04,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,446 INFO L628 ElimStorePlain]: treesize reduction 86, result has 51.7 percent of original size [2021-06-05 04:25:04,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:04,450 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:04,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:04,475 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:04,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:04,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:04,507 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:04,536 INFO L628 ElimStorePlain]: treesize reduction 21, result has 66.1 percent of original size [2021-06-05 04:25:04,537 INFO L518 ElimStorePlain]: Eliminatee v_prenex_163 vanished before elimination [2021-06-05 04:25:04,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:04,540 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:04,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:04,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:04,555 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:192, output treesize:32 [2021-06-05 04:25:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:04,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591959556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:04,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:04,601 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:25:04,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819998047] [2021-06-05 04:25:04,601 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:04,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:04,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:04,601 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:05,204 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2021-06-05 04:25:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:05,273 INFO L93 Difference]: Finished difference Result 363 states and 1105 transitions. [2021-06-05 04:25:05,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:25:05,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:05,274 INFO L225 Difference]: With dead ends: 363 [2021-06-05 04:25:05,274 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 04:25:05,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 948.1ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 04:25:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 305. [2021-06-05 04:25:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.101973684210526) internal successors, (943), 304 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 943 transitions. [2021-06-05 04:25:05,277 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 943 transitions. Word has length 17 [2021-06-05 04:25:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:05,277 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 943 transitions. [2021-06-05 04:25:05,277 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 943 transitions. [2021-06-05 04:25:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:05,278 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:05,278 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:05,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911,181 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:05,478 INFO L430 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1290551334, now seen corresponding path program 35 times [2021-06-05 04:25:05,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:05,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957518466] [2021-06-05 04:25:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:05,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:05,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957518466] [2021-06-05 04:25:05,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957518466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:05,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613799391] [2021-06-05 04:25:05,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:05,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 04:25:05,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:05,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:05,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:05,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:05,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:05,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:05,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:05,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:05,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:05,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:05,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:05,909 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:05,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:05,912 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:05,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:05,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:05,954 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:137 [2021-06-05 04:25:06,043 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_164, v_prenex_166, v_prenex_168], 1=[array_2, v_prenex_165, v_prenex_167, v_prenex_169]} [2021-06-05 04:25:06,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:06,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:25:06,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,160 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 04:25:06,160 INFO L628 ElimStorePlain]: treesize reduction 136, result has 55.3 percent of original size [2021-06-05 04:25:06,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:06,164 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:06,210 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:06,255 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:06,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:06,298 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:06,302 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,340 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,340 INFO L518 ElimStorePlain]: Eliminatee v_prenex_165 vanished before elimination [2021-06-05 04:25:06,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:06,343 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:06,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:06,384 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:06,419 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:06,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:06,421 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:321, output treesize:100 [2021-06-05 04:25:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:06,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613799391] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:06,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:06,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 04:25:06,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628985220] [2021-06-05 04:25:06,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:06,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:06,557 INFO L87 Difference]: Start difference. First operand 305 states and 943 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:07,062 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2021-06-05 04:25:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:07,273 INFO L93 Difference]: Finished difference Result 361 states and 1099 transitions. [2021-06-05 04:25:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:25:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:07,274 INFO L225 Difference]: With dead ends: 361 [2021-06-05 04:25:07,274 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 04:25:07,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 914.0ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:07,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 04:25:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 303. [2021-06-05 04:25:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 04:25:07,278 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 04:25:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:07,278 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 04:25:07,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 04:25:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:07,278 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:07,278 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:07,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:07,479 INFO L430 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash -2132806164, now seen corresponding path program 36 times [2021-06-05 04:25:07,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:07,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237857943] [2021-06-05 04:25:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:07,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:07,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237857943] [2021-06-05 04:25:07,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237857943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:07,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542322915] [2021-06-05 04:25:07,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:07,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:25:07,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:07,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:07,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:07,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:07,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:07,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:07,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:07,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:07,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:07,966 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:08,036 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:08,040 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:08,100 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:08,104 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,156 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:25:08,157 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:241, output treesize:197 [2021-06-05 04:25:08,520 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_181, v_prenex_183, array_2, v_prenex_185, v_prenex_177, v_prenex_179], 1=[v_prenex_180, v_prenex_182, v_prenex_184, array_4, v_prenex_186, v_prenex_178]} [2021-06-05 04:25:08,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:08,526 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:08,532 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,705 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 93 [2021-06-05 04:25:08,706 INFO L628 ElimStorePlain]: treesize reduction 191, result has 53.1 percent of original size [2021-06-05 04:25:08,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:08,713 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:08,775 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:08,834 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:08,891 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:08,947 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:08,951 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:08,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:08,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:08,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:09,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:09,000 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:09,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:09,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:09,006 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:09,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:09,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:09,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:09,055 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:09,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:09,098 INFO L518 ElimStorePlain]: Eliminatee v_prenex_184 vanished before elimination [2021-06-05 04:25:09,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:09,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:09,102 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:09,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:09,143 INFO L518 ElimStorePlain]: Eliminatee v_prenex_186 vanished before elimination [2021-06-05 04:25:09,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:09,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:09,148 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:09,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:09,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:25:09,193 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:427, output treesize:67 [2021-06-05 04:25:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:09,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542322915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:09,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:09,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:09,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208986764] [2021-06-05 04:25:09,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:09,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:09,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:09,244 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:09,632 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2021-06-05 04:25:10,113 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 124 [2021-06-05 04:25:10,345 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2021-06-05 04:25:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:10,382 INFO L93 Difference]: Finished difference Result 384 states and 1130 transitions. [2021-06-05 04:25:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:25:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:10,383 INFO L225 Difference]: With dead ends: 384 [2021-06-05 04:25:10,383 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 04:25:10,383 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1377.5ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:25:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 04:25:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 306. [2021-06-05 04:25:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.095081967213115) internal successors, (944), 305 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 944 transitions. [2021-06-05 04:25:10,386 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 944 transitions. Word has length 17 [2021-06-05 04:25:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:10,387 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 944 transitions. [2021-06-05 04:25:10,387 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 944 transitions. [2021-06-05 04:25:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:10,387 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:10,387 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:10,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938,183 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:10,587 INFO L430 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 213094778, now seen corresponding path program 37 times [2021-06-05 04:25:10,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:10,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560118194] [2021-06-05 04:25:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:10,891 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:10,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560118194] [2021-06-05 04:25:10,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560118194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:10,891 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001151885] [2021-06-05 04:25:10,892 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:10,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:10,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:11,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:11,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:11,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:11,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:11,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:11,068 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:11,118 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:11,118 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:161 [2021-06-05 04:25:11,521 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_192, v_prenex_194, array_2, v_prenex_197, v_prenex_199, v_prenex_202], 1=[v_prenex_193, v_prenex_195, array_4, v_prenex_198, v_prenex_200, v_prenex_203]} [2021-06-05 04:25:11,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:11,529 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:11,537 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,718 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 88 [2021-06-05 04:25:11,718 INFO L628 ElimStorePlain]: treesize reduction 192, result has 52.6 percent of original size [2021-06-05 04:25:11,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:11,723 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:11,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:11,783 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:11,788 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:11,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:11,843 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:11,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:11,901 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:11,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:11,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:11,966 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:12,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:12,023 INFO L518 ElimStorePlain]: Eliminatee v_prenex_193 vanished before elimination [2021-06-05 04:25:12,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:25:12,030 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:12,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:12,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:25:12,090 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:12,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:12,094 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:12,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:12,137 INFO L518 ElimStorePlain]: Eliminatee v_prenex_198 vanished before elimination [2021-06-05 04:25:12,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:25:12,144 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:12,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:12,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:12,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:12,191 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:12,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:12,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:25:12,237 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:419, output treesize:67 [2021-06-05 04:25:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:12,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001151885] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:12,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:12,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:12,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637087159] [2021-06-05 04:25:12,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:12,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:12,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:12,294 INFO L87 Difference]: Start difference. First operand 306 states and 944 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:13,193 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 04:25:13,473 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2021-06-05 04:25:13,820 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2021-06-05 04:25:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:13,892 INFO L93 Difference]: Finished difference Result 375 states and 1128 transitions. [2021-06-05 04:25:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 04:25:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:13,893 INFO L225 Difference]: With dead ends: 375 [2021-06-05 04:25:13,893 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 04:25:13,893 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1874.0ms TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:25:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 04:25:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 308. [2021-06-05 04:25:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.0912052117263844) internal successors, (949), 307 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 949 transitions. [2021-06-05 04:25:13,896 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 949 transitions. Word has length 17 [2021-06-05 04:25:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:13,896 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 949 transitions. [2021-06-05 04:25:13,897 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 949 transitions. [2021-06-05 04:25:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:13,897 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:13,897 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:14,097 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable982 [2021-06-05 04:25:14,098 INFO L430 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1694332648, now seen corresponding path program 38 times [2021-06-05 04:25:14,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:14,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248554750] [2021-06-05 04:25:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:14,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:14,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248554750] [2021-06-05 04:25:14,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248554750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:14,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274419530] [2021-06-05 04:25:14,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:14,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:14,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:14,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:14,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:14,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:14,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:14,514 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:14,545 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:14,548 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:14,572 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:86 [2021-06-05 04:25:14,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:14,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,814 INFO L628 ElimStorePlain]: treesize reduction 104, result has 48.5 percent of original size [2021-06-05 04:25:14,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:14,818 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:14,846 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:14,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:14,880 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:14,911 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:14,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:25:14,940 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:14,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:14,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:14,969 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:14,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:14,992 INFO L518 ElimStorePlain]: Eliminatee v_prenex_205 vanished before elimination [2021-06-05 04:25:14,994 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:14,994 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:213, output treesize:38 [2021-06-05 04:25:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:15,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274419530] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:15,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:15,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:25:15,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788527810] [2021-06-05 04:25:15,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:25:15,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:25:15,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:25:15,042 INFO L87 Difference]: Start difference. First operand 308 states and 949 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:15,929 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2021-06-05 04:25:16,221 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2021-06-05 04:25:16,371 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2021-06-05 04:25:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:16,450 INFO L93 Difference]: Finished difference Result 370 states and 1110 transitions. [2021-06-05 04:25:16,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:25:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:16,450 INFO L225 Difference]: With dead ends: 370 [2021-06-05 04:25:16,450 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 04:25:16,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1461.4ms TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:25:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 04:25:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 301. [2021-06-05 04:25:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 04:25:16,454 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 04:25:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:16,454 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 04:25:16,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 04:25:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:16,454 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:16,454 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:16,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1018 [2021-06-05 04:25:16,655 INFO L430 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1115333512, now seen corresponding path program 39 times [2021-06-05 04:25:16,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:16,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093049245] [2021-06-05 04:25:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:16,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:16,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093049245] [2021-06-05 04:25:16,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093049245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:16,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565341974] [2021-06-05 04:25:16,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:16,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:25:16,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:16,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:16,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:16,977 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:16,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:16,980 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:16,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:16,985 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:16,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:16,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:16,989 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:17,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:17,033 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:135 [2021-06-05 04:25:17,290 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-06-05 04:25:17,566 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_229, array_2, v_prenex_221, v_prenex_223, v_prenex_225, v_prenex_227], 1=[v_prenex_228, array_4, v_prenex_230, v_prenex_222, v_prenex_224, v_prenex_226]} [2021-06-05 04:25:17,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:17,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:17,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,765 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-06-05 04:25:17,766 INFO L628 ElimStorePlain]: treesize reduction 176, result has 54.6 percent of original size [2021-06-05 04:25:17,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:17,771 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:17,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:17,831 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:17,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:17,889 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:17,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:17,946 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:17,950 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:17,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:18,003 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:18,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_228 vanished before elimination [2021-06-05 04:25:18,049 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:25:18,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:18,054 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:18,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:18,104 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:18,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:18,155 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:18,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:25:18,204 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:18,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:18,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:18,209 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:18,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:18,255 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 04:25:18,255 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:407, output treesize:79 [2021-06-05 04:25:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:18,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565341974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:18,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:18,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:18,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730425733] [2021-06-05 04:25:18,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:18,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:18,316 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:18,601 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-06-05 04:25:18,962 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2021-06-05 04:25:19,146 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-06-05 04:25:19,764 WARN L205 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 132 [2021-06-05 04:25:20,104 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 118 [2021-06-05 04:25:20,258 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-06-05 04:25:20,662 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2021-06-05 04:25:20,954 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2021-06-05 04:25:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:21,061 INFO L93 Difference]: Finished difference Result 489 states and 1426 transitions. [2021-06-05 04:25:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 04:25:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:21,062 INFO L225 Difference]: With dead ends: 489 [2021-06-05 04:25:21,062 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 04:25:21,062 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2936.4ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:25:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 04:25:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 301. [2021-06-05 04:25:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 04:25:21,066 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 04:25:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:21,066 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 04:25:21,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 04:25:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:21,066 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:21,066 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:21,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 186 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1059 [2021-06-05 04:25:21,267 INFO L430 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 672434372, now seen corresponding path program 40 times [2021-06-05 04:25:21,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:21,267 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289999056] [2021-06-05 04:25:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:21,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:21,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289999056] [2021-06-05 04:25:21,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289999056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:21,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039404779] [2021-06-05 04:25:21,667 INFO L93 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 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:21,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:25:21,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:21,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:21,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:21,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:21,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:21,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:21,804 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:21,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:21,809 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:21,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:21,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:21,813 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:21,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:21,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:21,875 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:139 [2021-06-05 04:25:22,385 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_240, v_prenex_242, v_prenex_244, v_prenex_246, v_prenex_238], 1=[v_prenex_239, array_4, v_prenex_241, v_prenex_243, v_prenex_245, v_prenex_247]} [2021-06-05 04:25:22,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:22,392 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:22,400 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,564 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2021-06-05 04:25:22,564 INFO L628 ElimStorePlain]: treesize reduction 202, result has 51.6 percent of original size [2021-06-05 04:25:22,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:22,570 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:22,575 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,629 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:22,634 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:22,691 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:22,751 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:22,803 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:22,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:22,855 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:22,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,901 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:25:22,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:22,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:22,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:25:22,907 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:22,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:22,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:22,912 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:22,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:22,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:22,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:22,962 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:23,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:23,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:23,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:23,011 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:23,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:23,055 INFO L518 ElimStorePlain]: Eliminatee v_prenex_247 vanished before elimination [2021-06-05 04:25:23,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:25:23,057 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:431, output treesize:71 [2021-06-05 04:25:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:23,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039404779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:23,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:23,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:23,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558152369] [2021-06-05 04:25:23,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:23,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:23,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:23,112 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:23,498 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-06-05 04:25:23,895 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2021-06-05 04:25:24,115 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2021-06-05 04:25:24,767 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 142 [2021-06-05 04:25:25,176 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 136 [2021-06-05 04:25:25,363 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2021-06-05 04:25:25,803 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2021-06-05 04:25:26,136 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 118 [2021-06-05 04:25:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:26,271 INFO L93 Difference]: Finished difference Result 483 states and 1377 transitions. [2021-06-05 04:25:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 04:25:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:26,272 INFO L225 Difference]: With dead ends: 483 [2021-06-05 04:25:26,272 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 04:25:26,272 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3385.9ms TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:25:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 04:25:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 305. [2021-06-05 04:25:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0921052631578947) internal successors, (940), 304 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 940 transitions. [2021-06-05 04:25:26,276 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 940 transitions. Word has length 17 [2021-06-05 04:25:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:26,276 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 940 transitions. [2021-06-05 04:25:26,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 940 transitions. [2021-06-05 04:25:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:26,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:26,276 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:26,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:26,477 INFO L430 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1633532686, now seen corresponding path program 41 times [2021-06-05 04:25:26,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:26,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134517037] [2021-06-05 04:25:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:26,895 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:26,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134517037] [2021-06-05 04:25:26,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134517037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:26,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910932804] [2021-06-05 04:25:26,895 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:26,921 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:26,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:26,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 04:25:26,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:27,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:27,090 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:27,095 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:27,144 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:27,148 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:27,189 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 04:25:27,365 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_253, v_prenex_255, v_prenex_257], 1=[array_4, v_prenex_254, v_prenex_256, v_prenex_258]} [2021-06-05 04:25:27,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:27,369 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:25:27,374 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,435 INFO L628 ElimStorePlain]: treesize reduction 114, result has 46.0 percent of original size [2021-06-05 04:25:27,435 INFO L518 ElimStorePlain]: Eliminatee v_prenex_253 vanished before elimination [2021-06-05 04:25:27,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:27,439 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:27,464 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:25:27,488 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:27,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,508 INFO L518 ElimStorePlain]: Eliminatee v_prenex_254 vanished before elimination [2021-06-05 04:25:27,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:27,512 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:27,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:27,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:25:27,534 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:27,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:27,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:27,555 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 04:25:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:27,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910932804] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:27,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:27,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:27,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003483722] [2021-06-05 04:25:27,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:27,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:27,592 INFO L87 Difference]: Start difference. First operand 305 states and 940 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:28,596 INFO L93 Difference]: Finished difference Result 380 states and 1151 transitions. [2021-06-05 04:25:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:25:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:28,596 INFO L225 Difference]: With dead ends: 380 [2021-06-05 04:25:28,597 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 04:25:28,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1201.1ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:25:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 04:25:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 307. [2021-06-05 04:25:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.0915032679738563) internal successors, (946), 306 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 946 transitions. [2021-06-05 04:25:28,600 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 946 transitions. Word has length 17 [2021-06-05 04:25:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:28,600 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 946 transitions. [2021-06-05 04:25:28,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 946 transitions. [2021-06-05 04:25:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:28,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:28,600 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:28,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1123 [2021-06-05 04:25:28,801 INFO L430 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1560160206, now seen corresponding path program 42 times [2021-06-05 04:25:28,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:28,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461286261] [2021-06-05 04:25:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:29,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:29,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461286261] [2021-06-05 04:25:29,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461286261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:29,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484792469] [2021-06-05 04:25:29,064 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:29,090 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:25:29,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:29,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:29,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:29,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:29,281 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:29,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:29,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:29,338 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:29,343 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,384 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:29,388 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:29,388 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:154 [2021-06-05 04:25:29,500 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 04:25:29,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:29,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:25:29,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:29,518 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:29,525 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:29,530 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:29,535 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:29,540 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:29,544 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,678 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 04:25:29,678 INFO L628 ElimStorePlain]: treesize reduction 138, result has 56.5 percent of original size [2021-06-05 04:25:29,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:29,683 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:29,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:29,688 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:29,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:29,693 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:29,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:29,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:29,697 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:29,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:29,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:29,751 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:395, output treesize:101 [2021-06-05 04:25:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:29,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484792469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:29,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:29,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:25:29,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971345348] [2021-06-05 04:25:29,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:29,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:29,870 INFO L87 Difference]: Start difference. First operand 307 states and 946 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:30,440 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2021-06-05 04:25:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:30,561 INFO L93 Difference]: Finished difference Result 358 states and 1087 transitions. [2021-06-05 04:25:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:25:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:30,562 INFO L225 Difference]: With dead ends: 358 [2021-06-05 04:25:30,562 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 04:25:30,562 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 849.0ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:25:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 04:25:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 301. [2021-06-05 04:25:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 04:25:30,567 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 04:25:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:30,567 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 04:25:30,567 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 04:25:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:30,568 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:30,568 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:30,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:30,789 INFO L430 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1698524914, now seen corresponding path program 43 times [2021-06-05 04:25:30,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:30,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032624492] [2021-06-05 04:25:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:31,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:31,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032624492] [2021-06-05 04:25:31,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032624492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:31,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760622222] [2021-06-05 04:25:31,169 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:31,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:31,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:31,335 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_265], 3=[array_0]} [2021-06-05 04:25:31,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:31,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:31,346 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:31,393 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:31,398 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:31,431 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:115 [2021-06-05 04:25:31,575 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_270, array_2, v_prenex_272, v_prenex_268], 1=[v_prenex_271, v_prenex_273, array_4, v_prenex_269]} [2021-06-05 04:25:31,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:31,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:31,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,678 INFO L628 ElimStorePlain]: treesize reduction 85, result has 65.0 percent of original size [2021-06-05 04:25:31,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:31,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:31,686 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:31,724 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:31,760 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,790 INFO L518 ElimStorePlain]: Eliminatee v_prenex_271 vanished before elimination [2021-06-05 04:25:31,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:25:31,795 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:31,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:31,830 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:31,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:31,834 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:31,862 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:31,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:31,866 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:31,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:31,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:31,896 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:257, output treesize:48 [2021-06-05 04:25:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:31,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760622222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:31,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:31,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:31,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787070032] [2021-06-05 04:25:31,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:31,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:31,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:31,946 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:32,529 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 04:25:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:32,629 INFO L93 Difference]: Finished difference Result 357 states and 1080 transitions. [2021-06-05 04:25:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:25:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:32,630 INFO L225 Difference]: With dead ends: 357 [2021-06-05 04:25:32,630 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 04:25:32,630 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 911.1ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 04:25:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2021-06-05 04:25:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 04:25:32,634 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 04:25:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:32,634 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 04:25:32,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 04:25:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:32,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:32,634 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:32,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 190 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1166 [2021-06-05 04:25:32,835 INFO L430 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash -217287044, now seen corresponding path program 44 times [2021-06-05 04:25:32,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:32,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707797898] [2021-06-05 04:25:32,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:33,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:33,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707797898] [2021-06-05 04:25:33,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707797898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:33,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302262481] [2021-06-05 04:25:33,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:33,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:33,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:33,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:33,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:33,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:33,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:33,156 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:33,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:33,191 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,215 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:33,215 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:92 [2021-06-05 04:25:33,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:33,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:33,384 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,448 INFO L628 ElimStorePlain]: treesize reduction 114, result has 46.0 percent of original size [2021-06-05 04:25:33,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:33,452 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:33,477 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:33,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:33,502 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:33,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,522 INFO L518 ElimStorePlain]: Eliminatee v_prenex_275 vanished before elimination [2021-06-05 04:25:33,522 INFO L518 ElimStorePlain]: Eliminatee v_prenex_276 vanished before elimination [2021-06-05 04:25:33,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:25:33,526 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:33,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:33,548 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:33,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:33,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:33,568 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:225, output treesize:38 [2021-06-05 04:25:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:33,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302262481] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:33,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:33,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:25:33,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50354191] [2021-06-05 04:25:33,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:25:33,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:33,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:25:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:25:33,606 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:34,214 INFO L93 Difference]: Finished difference Result 355 states and 1076 transitions. [2021-06-05 04:25:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:25:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:34,215 INFO L225 Difference]: With dead ends: 355 [2021-06-05 04:25:34,215 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 04:25:34,215 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 688.3ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 04:25:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2021-06-05 04:25:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.0930232558139537) internal successors, (931), 301 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 931 transitions. [2021-06-05 04:25:34,218 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 931 transitions. Word has length 17 [2021-06-05 04:25:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:34,218 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 931 transitions. [2021-06-05 04:25:34,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 931 transitions. [2021-06-05 04:25:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:34,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:34,218 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:34,419 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:34,419 INFO L430 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 331629366, now seen corresponding path program 45 times [2021-06-05 04:25:34,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:34,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684460077] [2021-06-05 04:25:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:34,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:34,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684460077] [2021-06-05 04:25:34,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684460077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:34,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480425846] [2021-06-05 04:25:34,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:34,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:25:34,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:34,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:35,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:35,087 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:35,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:35,142 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:35,147 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:35,180 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 04:25:35,342 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_290, v_prenex_292, array_2, v_prenex_288], 1=[v_prenex_291, v_prenex_293, array_4, v_prenex_289]} [2021-06-05 04:25:35,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:35,349 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:35,354 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,443 INFO L628 ElimStorePlain]: treesize reduction 89, result has 61.5 percent of original size [2021-06-05 04:25:35,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:35,447 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,482 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:35,486 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:25:35,490 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:35,525 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:35,558 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:35,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,587 INFO L518 ElimStorePlain]: Eliminatee v_prenex_293 vanished before elimination [2021-06-05 04:25:35,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:25:35,592 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:35,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:35,596 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:35,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:35,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:35,628 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:35,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:35,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:35,658 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 04:25:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:35,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480425846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:35,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:35,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:35,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961060599] [2021-06-05 04:25:35,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:35,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:35,709 INFO L87 Difference]: Start difference. First operand 302 states and 931 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:36,179 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2021-06-05 04:25:36,353 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2021-06-05 04:25:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:36,445 INFO L93 Difference]: Finished difference Result 354 states and 1074 transitions. [2021-06-05 04:25:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:25:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:36,446 INFO L225 Difference]: With dead ends: 354 [2021-06-05 04:25:36,446 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 04:25:36,446 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1096.2ms TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 04:25:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 304. [2021-06-05 04:25:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.092409240924092) internal successors, (937), 303 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 937 transitions. [2021-06-05 04:25:36,450 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 937 transitions. Word has length 17 [2021-06-05 04:25:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:36,451 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 937 transitions. [2021-06-05 04:25:36,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 937 transitions. [2021-06-05 04:25:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:36,451 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:36,451 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:36,656 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:36,657 INFO L430 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:36,657 INFO L82 PathProgramCache]: Analyzing trace with hash -483176788, now seen corresponding path program 46 times [2021-06-05 04:25:36,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:36,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294512531] [2021-06-05 04:25:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:37,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:37,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294512531] [2021-06-05 04:25:37,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294512531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:37,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147372265] [2021-06-05 04:25:37,059 INFO L93 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 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:37,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:25:37,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:37,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:37,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:37,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:37,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:37,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:37,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:37,282 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:37,316 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:113 [2021-06-05 04:25:37,424 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_300, v_prenex_302, v_prenex_304], 1=[array_0, v_prenex_299, v_prenex_301, v_prenex_303]} [2021-06-05 04:25:37,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:37,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:37,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,494 INFO L628 ElimStorePlain]: treesize reduction 123, result has 44.8 percent of original size [2021-06-05 04:25:37,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:37,497 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:37,522 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,542 INFO L518 ElimStorePlain]: Eliminatee v_prenex_304 vanished before elimination [2021-06-05 04:25:37,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:37,546 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:37,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:37,570 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:37,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:37,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:37,592 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:37,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:37,611 INFO L518 ElimStorePlain]: Eliminatee v_prenex_303 vanished before elimination [2021-06-05 04:25:37,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:37,613 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 04:25:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:37,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147372265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:37,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:37,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:37,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974110152] [2021-06-05 04:25:37,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:37,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:37,653 INFO L87 Difference]: Start difference. First operand 304 states and 937 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:38,231 INFO L93 Difference]: Finished difference Result 368 states and 1120 transitions. [2021-06-05 04:25:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:25:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:38,232 INFO L225 Difference]: With dead ends: 368 [2021-06-05 04:25:38,232 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 04:25:38,233 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 781.1ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 04:25:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2021-06-05 04:25:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 04:25:38,236 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 04:25:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:38,236 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 04:25:38,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 04:25:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:38,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:38,237 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:38,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262,193 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:38,437 INFO L430 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash 538722348, now seen corresponding path program 47 times [2021-06-05 04:25:38,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:38,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874080797] [2021-06-05 04:25:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:38,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:38,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874080797] [2021-06-05 04:25:38,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874080797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:38,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627755586] [2021-06-05 04:25:38,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:38,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:25:38,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:38,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:38,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:38,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:38,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:38,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:38,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:38,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:38,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:38,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:38,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:38,913 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:38,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:38,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:38,937 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 04:25:39,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:39,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:39,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:39,095 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:39,160 INFO L628 ElimStorePlain]: treesize reduction 112, result has 45.9 percent of original size [2021-06-05 04:25:39,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:39,164 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:39,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:39,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:39,190 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:39,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:39,211 INFO L518 ElimStorePlain]: Eliminatee v_prenex_309 vanished before elimination [2021-06-05 04:25:39,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:39,215 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:39,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:39,235 INFO L518 ElimStorePlain]: Eliminatee v_prenex_310 vanished before elimination [2021-06-05 04:25:39,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:25:39,239 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:39,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:39,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:39,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:39,261 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:39,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:39,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:39,282 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:221, output treesize:38 [2021-06-05 04:25:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:39,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627755586] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:39,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:39,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:25:39,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619661602] [2021-06-05 04:25:39,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:25:39,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:25:39,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:25:39,325 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:39,847 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2021-06-05 04:25:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:39,922 INFO L93 Difference]: Finished difference Result 354 states and 1076 transitions. [2021-06-05 04:25:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:25:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:39,922 INFO L225 Difference]: With dead ends: 354 [2021-06-05 04:25:39,922 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 04:25:39,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 787.7ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:25:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 04:25:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 305. [2021-06-05 04:25:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0953947368421053) internal successors, (941), 304 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 941 transitions. [2021-06-05 04:25:39,926 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 941 transitions. Word has length 17 [2021-06-05 04:25:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:39,926 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 941 transitions. [2021-06-05 04:25:39,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 941 transitions. [2021-06-05 04:25:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:39,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:39,926 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:40,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 194 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1287 [2021-06-05 04:25:40,127 INFO L430 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash 881305860, now seen corresponding path program 48 times [2021-06-05 04:25:40,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:40,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535839509] [2021-06-05 04:25:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:40,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:40,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535839509] [2021-06-05 04:25:40,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535839509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:40,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448828250] [2021-06-05 04:25:40,364 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:40,390 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 04:25:40,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:40,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:40,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:40,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:40,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:40,481 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:40,485 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:40,489 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:40,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:40,539 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:163 [2021-06-05 04:25:40,638 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_316, v_prenex_318, array_2, v_prenex_320], 1=[v_prenex_317, array_0, v_prenex_319, v_prenex_315]} [2021-06-05 04:25:40,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:40,644 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:25:40,648 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,795 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2021-06-05 04:25:40,795 INFO L628 ElimStorePlain]: treesize reduction 164, result has 54.1 percent of original size [2021-06-05 04:25:40,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:40,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:40,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:40,857 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:40,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:40,913 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:40,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:40,964 INFO L518 ElimStorePlain]: Eliminatee v_prenex_317 vanished before elimination [2021-06-05 04:25:40,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:40,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:40,968 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:41,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:41,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:41,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:41,021 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:41,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:41,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:41,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:41,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:25:41,074 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:41,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:41,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:41,077 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:41,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:41,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:41,124 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:375, output treesize:124 [2021-06-05 04:25:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:41,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448828250] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:41,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:41,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:25:41,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192842624] [2021-06-05 04:25:41,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:41,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:41,269 INFO L87 Difference]: Start difference. First operand 305 states and 941 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:41,598 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-06-05 04:25:41,731 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-06-05 04:25:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:41,800 INFO L93 Difference]: Finished difference Result 352 states and 1070 transitions. [2021-06-05 04:25:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:25:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:41,801 INFO L225 Difference]: With dead ends: 352 [2021-06-05 04:25:41,801 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 04:25:41,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 744.5ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:25:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 04:25:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 303. [2021-06-05 04:25:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 04:25:41,804 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 04:25:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:41,804 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 04:25:41,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 04:25:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:41,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:41,805 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:42,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1329 [2021-06-05 04:25:42,005 INFO L430 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1017508532, now seen corresponding path program 49 times [2021-06-05 04:25:42,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:42,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752122598] [2021-06-05 04:25:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:42,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:42,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752122598] [2021-06-05 04:25:42,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752122598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:42,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395000465] [2021-06-05 04:25:42,367 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:42,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:42,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:42,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:42,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:42,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:42,516 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:42,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:42,520 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:42,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:42,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:42,524 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:42,578 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:42,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:42,581 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:163 [2021-06-05 04:25:43,091 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_338, array_2, v_prenex_340, v_prenex_332, v_prenex_334, v_prenex_336], 1=[v_prenex_339, array_4, v_prenex_341, v_prenex_333, v_prenex_335, v_prenex_337]} [2021-06-05 04:25:43,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:43,098 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:43,104 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,274 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2021-06-05 04:25:43,274 INFO L628 ElimStorePlain]: treesize reduction 211, result has 51.3 percent of original size [2021-06-05 04:25:43,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:43,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:43,342 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:43,403 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:43,462 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:43,519 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:43,523 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,572 INFO L518 ElimStorePlain]: Eliminatee v_prenex_339 vanished before elimination [2021-06-05 04:25:43,572 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:25:43,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:43,577 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:43,629 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:43,681 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:25:43,734 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:43,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:43,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:43,738 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:43,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:43,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 04:25:43,788 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:447, output treesize:81 [2021-06-05 04:25:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:43,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395000465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:43,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:43,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:43,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897871685] [2021-06-05 04:25:43,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:43,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:43,850 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:44,359 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2021-06-05 04:25:44,755 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 104 [2021-06-05 04:25:45,481 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 155 [2021-06-05 04:25:45,952 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 118 [2021-06-05 04:25:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:46,023 INFO L93 Difference]: Finished difference Result 483 states and 1414 transitions. [2021-06-05 04:25:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:25:46,023 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:46,024 INFO L225 Difference]: With dead ends: 483 [2021-06-05 04:25:46,024 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 04:25:46,024 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2463.1ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:25:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 04:25:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 327. [2021-06-05 04:25:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 3.1165644171779143) internal successors, (1016), 326 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1016 transitions. [2021-06-05 04:25:46,028 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1016 transitions. Word has length 17 [2021-06-05 04:25:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:46,028 INFO L482 AbstractCegarLoop]: Abstraction has 327 states and 1016 transitions. [2021-06-05 04:25:46,028 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1016 transitions. [2021-06-05 04:25:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:46,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:46,028 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:46,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349,196 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:46,229 INFO L430 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:46,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1698860488, now seen corresponding path program 50 times [2021-06-05 04:25:46,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:46,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587367547] [2021-06-05 04:25:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:46,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:46,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587367547] [2021-06-05 04:25:46,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587367547] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:46,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85806679] [2021-06-05 04:25:46,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:46,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:46,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:46,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:46,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:46,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:46,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:46,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:46,830 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:46,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:46,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:46,863 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:46,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:46,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:46,867 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:46,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:46,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:46,895 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:97 [2021-06-05 04:25:47,105 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_350, v_prenex_346, v_prenex_348], 1=[v_prenex_349, array_4, v_prenex_351, v_prenex_347]} [2021-06-05 04:25:47,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:47,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:47,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:47,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:47,179 INFO L628 ElimStorePlain]: treesize reduction 108, result has 47.6 percent of original size [2021-06-05 04:25:47,179 INFO L518 ElimStorePlain]: Eliminatee v_prenex_350 vanished before elimination [2021-06-05 04:25:47,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:47,183 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:47,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:47,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:47,208 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:47,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:47,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:47,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:47,232 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:47,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:47,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:47,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:47,255 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:47,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:47,274 INFO L518 ElimStorePlain]: Eliminatee v_prenex_351 vanished before elimination [2021-06-05 04:25:47,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:47,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:47,278 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:47,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:47,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:47,299 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:227, output treesize:38 [2021-06-05 04:25:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:47,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85806679] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:47,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:47,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:47,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316813453] [2021-06-05 04:25:47,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:47,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:47,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:47,338 INFO L87 Difference]: Start difference. First operand 327 states and 1016 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:47,590 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 04:25:47,844 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2021-06-05 04:25:48,354 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 118 [2021-06-05 04:25:48,875 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 116 [2021-06-05 04:25:49,155 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 115 [2021-06-05 04:25:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:49,475 INFO L93 Difference]: Finished difference Result 544 states and 1579 transitions. [2021-06-05 04:25:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:25:49,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:49,476 INFO L225 Difference]: With dead ends: 544 [2021-06-05 04:25:49,476 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 04:25:49,476 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2209.4ms TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:25:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 04:25:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 336. [2021-06-05 04:25:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 3.1671641791044776) internal successors, (1061), 335 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1061 transitions. [2021-06-05 04:25:49,480 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1061 transitions. Word has length 17 [2021-06-05 04:25:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:49,480 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 1061 transitions. [2021-06-05 04:25:49,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1061 transitions. [2021-06-05 04:25:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:49,481 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:49,481 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:49,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1382 [2021-06-05 04:25:49,681 INFO L430 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:49,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:49,681 INFO L82 PathProgramCache]: Analyzing trace with hash -56410218, now seen corresponding path program 51 times [2021-06-05 04:25:49,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:49,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197885173] [2021-06-05 04:25:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:50,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:50,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197885173] [2021-06-05 04:25:50,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197885173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:50,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984082990] [2021-06-05 04:25:50,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:50,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:25:50,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:50,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:25:50,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:50,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:50,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:50,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:50,232 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:50,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,270 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:50,270 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 04:25:50,413 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_360, v_prenex_356, v_prenex_358], 1=[v_prenex_361, array_4, v_prenex_357, v_prenex_359]} [2021-06-05 04:25:50,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:50,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:50,422 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,490 INFO L628 ElimStorePlain]: treesize reduction 113, result has 45.9 percent of original size [2021-06-05 04:25:50,490 INFO L518 ElimStorePlain]: Eliminatee v_prenex_360 vanished before elimination [2021-06-05 04:25:50,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:50,493 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:25:50,518 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,539 INFO L518 ElimStorePlain]: Eliminatee v_prenex_361 vanished before elimination [2021-06-05 04:25:50,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:50,543 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:50,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:50,567 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:50,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:50,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:25:50,590 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:50,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:50,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:50,617 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 04:25:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:50,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984082990] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:50,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:50,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:50,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084302094] [2021-06-05 04:25:50,654 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:50,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:50,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:50,655 INFO L87 Difference]: Start difference. First operand 336 states and 1061 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:51,061 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2021-06-05 04:25:51,241 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2021-06-05 04:25:51,439 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2021-06-05 04:25:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:51,635 INFO L93 Difference]: Finished difference Result 447 states and 1358 transitions. [2021-06-05 04:25:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:25:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:51,636 INFO L225 Difference]: With dead ends: 447 [2021-06-05 04:25:51,636 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 04:25:51,636 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1076.7ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:25:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 04:25:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 340. [2021-06-05 04:25:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.1799410029498527) internal successors, (1078), 339 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1078 transitions. [2021-06-05 04:25:51,640 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1078 transitions. Word has length 17 [2021-06-05 04:25:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:51,640 INFO L482 AbstractCegarLoop]: Abstraction has 340 states and 1078 transitions. [2021-06-05 04:25:51,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1078 transitions. [2021-06-05 04:25:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:51,640 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:51,640 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:51,841 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1407,198 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:51,841 INFO L430 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash -129782698, now seen corresponding path program 52 times [2021-06-05 04:25:51,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:51,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086783745] [2021-06-05 04:25:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:52,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:52,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086783745] [2021-06-05 04:25:52,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086783745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:52,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936857133] [2021-06-05 04:25:52,083 INFO L93 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 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:52,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:25:52,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:52,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:52,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:52,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:52,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:52,289 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:52,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:52,341 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:52,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:52,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:52,389 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:153 [2021-06-05 04:25:52,500 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 04:25:52,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:52,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:52,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:52,516 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:52,521 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:52,526 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:52,531 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:25:52,535 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:25:52,540 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,673 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-06-05 04:25:52,674 INFO L628 ElimStorePlain]: treesize reduction 141, result has 56.1 percent of original size [2021-06-05 04:25:52,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:52,679 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:52,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:52,685 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:52,690 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:52,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:52,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:52,695 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:52,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:52,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:25:52,748 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:393, output treesize:101 [2021-06-05 04:25:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:52,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936857133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:52,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:52,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:52,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107937984] [2021-06-05 04:25:52,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:52,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:52,870 INFO L87 Difference]: Start difference. First operand 340 states and 1078 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:53,450 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 04:25:53,606 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-06-05 04:25:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:53,763 INFO L93 Difference]: Finished difference Result 446 states and 1363 transitions. [2021-06-05 04:25:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:25:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:53,764 INFO L225 Difference]: With dead ends: 446 [2021-06-05 04:25:53,764 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 04:25:53,764 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1003.9ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:25:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 04:25:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 341. [2021-06-05 04:25:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.1852941176470586) internal successors, (1083), 340 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2021-06-05 04:25:53,768 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 17 [2021-06-05 04:25:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:53,768 INFO L482 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2021-06-05 04:25:53,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2021-06-05 04:25:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:53,768 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:53,768 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:53,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1432,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:53,969 INFO L430 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -28866952, now seen corresponding path program 53 times [2021-06-05 04:25:53,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:53,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881628001] [2021-06-05 04:25:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:54,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:54,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881628001] [2021-06-05 04:25:54,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881628001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:54,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121331544] [2021-06-05 04:25:54,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:54,369 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:25:54,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:54,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 04:25:54,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:54,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:54,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:54,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:54,584 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:54,587 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,621 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:25:54,621 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:113 [2021-06-05 04:25:54,774 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_371, array_2, v_prenex_373, v_prenex_375], 1=[v_prenex_372, array_4, v_prenex_374, v_prenex_376]} [2021-06-05 04:25:54,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:54,779 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:25:54,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,846 INFO L628 ElimStorePlain]: treesize reduction 123, result has 46.3 percent of original size [2021-06-05 04:25:54,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:54,850 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,872 INFO L518 ElimStorePlain]: Eliminatee v_prenex_373 vanished before elimination [2021-06-05 04:25:54,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:54,875 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:54,902 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:54,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:54,926 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:54,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,945 INFO L518 ElimStorePlain]: Eliminatee v_prenex_374 vanished before elimination [2021-06-05 04:25:54,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:54,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:54,948 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:54,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:54,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:25:54,968 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 04:25:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:55,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121331544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:55,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:55,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:25:55,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025331176] [2021-06-05 04:25:55,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:25:55,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:55,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:25:55,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:25:55,006 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:55,428 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2021-06-05 04:25:55,605 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-06-05 04:25:55,843 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 56 [2021-06-05 04:25:56,047 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2021-06-05 04:25:56,421 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2021-06-05 04:25:56,630 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2021-06-05 04:25:57,017 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 107 [2021-06-05 04:25:57,194 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-06-05 04:25:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:25:57,511 INFO L93 Difference]: Finished difference Result 671 states and 2008 transitions. [2021-06-05 04:25:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:25:57,511 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:25:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:25:57,512 INFO L225 Difference]: With dead ends: 671 [2021-06-05 04:25:57,512 INFO L226 Difference]: Without dead ends: 655 [2021-06-05 04:25:57,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2452.7ms TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:25:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-06-05 04:25:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 355. [2021-06-05 04:25:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.189265536723164) internal successors, (1129), 354 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2021-06-05 04:25:57,517 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 17 [2021-06-05 04:25:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:25:57,518 INFO L482 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2021-06-05 04:25:57,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:25:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2021-06-05 04:25:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:25:57,518 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:25:57,518 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:25:57,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1450,200 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:57,719 INFO L430 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:25:57,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:25:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash -102239432, now seen corresponding path program 54 times [2021-06-05 04:25:57,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:25:57,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325994450] [2021-06-05 04:25:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:25:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:25:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:58,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:25:58,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325994450] [2021-06-05 04:25:58,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325994450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:58,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10212042] [2021-06-05 04:25:58,009 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:25:58,044 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:25:58,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:25:58,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:25:58,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:25:58,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:58,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:58,334 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:58,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:58,404 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:58,408 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:58,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:25:58,474 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:58,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:25:58,478 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:58,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:25:58,539 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:229, output treesize:185 [2021-06-05 04:25:58,808 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_404, v_prenex_391, v_prenex_407, array_2, v_prenex_394, v_prenex_385, v_prenex_397, v_prenex_387, v_prenex_399, v_prenex_410, v_prenex_389, v_prenex_401], 1=[v_prenex_390, v_prenex_406, array_0, v_prenex_393, v_prenex_409, v_prenex_384, v_prenex_396, v_prenex_386, v_prenex_398, v_prenex_388, v_prenex_400, v_prenex_403]} [2021-06-05 04:25:58,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:25:58,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:58,948 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 105 [2021-06-05 04:25:58,948 INFO L628 ElimStorePlain]: treesize reduction 205, result has 52.3 percent of original size [2021-06-05 04:25:58,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:25:58,954 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:59,015 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,068 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:25:59,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:59,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:25:59,130 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,181 INFO L518 ElimStorePlain]: Eliminatee v_prenex_397 vanished before elimination [2021-06-05 04:25:59,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:25:59,186 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,236 INFO L518 ElimStorePlain]: Eliminatee v_prenex_399 vanished before elimination [2021-06-05 04:25:59,236 INFO L518 ElimStorePlain]: Eliminatee v_prenex_410 vanished before elimination [2021-06-05 04:25:59,236 INFO L518 ElimStorePlain]: Eliminatee v_prenex_389 vanished before elimination [2021-06-05 04:25:59,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:25:59,241 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:59,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:25:59,295 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:59,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:25:59,347 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,394 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 04:25:59,394 INFO L518 ElimStorePlain]: Eliminatee v_prenex_393 vanished before elimination [2021-06-05 04:25:59,394 INFO L518 ElimStorePlain]: Eliminatee v_prenex_409 vanished before elimination [2021-06-05 04:25:59,394 INFO L518 ElimStorePlain]: Eliminatee v_prenex_384 vanished before elimination [2021-06-05 04:25:59,394 INFO L518 ElimStorePlain]: Eliminatee v_prenex_396 vanished before elimination [2021-06-05 04:25:59,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:59,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:25:59,399 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:25:59,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,445 INFO L518 ElimStorePlain]: Eliminatee v_prenex_398 vanished before elimination [2021-06-05 04:25:59,445 INFO L518 ElimStorePlain]: Eliminatee v_prenex_388 vanished before elimination [2021-06-05 04:25:59,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:59,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:25:59,449 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:59,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:25:59,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:25:59,499 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:25:59,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:25:59,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 24 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 04:25:59,546 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 36 variables, input treesize:439, output treesize:81 [2021-06-05 04:25:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:25:59,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10212042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:25:59,611 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:25:59,611 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:25:59,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810550993] [2021-06-05 04:25:59,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:25:59,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:25:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:25:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:25:59,612 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:00,310 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2021-06-05 04:26:00,462 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2021-06-05 04:26:00,622 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-06-05 04:26:01,030 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 85 [2021-06-05 04:26:01,263 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2021-06-05 04:26:01,412 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 04:26:01,848 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 139 [2021-06-05 04:26:02,056 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 04:26:02,190 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 04:26:02,465 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2021-06-05 04:26:02,655 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2021-06-05 04:26:02,783 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-06-05 04:26:03,064 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-06-05 04:26:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:03,134 INFO L93 Difference]: Finished difference Result 630 states and 1888 transitions. [2021-06-05 04:26:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 04:26:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:03,136 INFO L225 Difference]: With dead ends: 630 [2021-06-05 04:26:03,136 INFO L226 Difference]: Without dead ends: 613 [2021-06-05 04:26:03,136 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3466.5ms TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 04:26:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-05 04:26:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 366. [2021-06-05 04:26:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.2) internal successors, (1168), 365 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1168 transitions. [2021-06-05 04:26:03,141 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1168 transitions. Word has length 17 [2021-06-05 04:26:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:03,141 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1168 transitions. [2021-06-05 04:26:03,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1168 transitions. [2021-06-05 04:26:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:03,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:03,141 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:03,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1475 [2021-06-05 04:26:03,342 INFO L430 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -99613656, now seen corresponding path program 55 times [2021-06-05 04:26:03,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:03,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434932140] [2021-06-05 04:26:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:03,764 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:03,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434932140] [2021-06-05 04:26:03,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434932140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:03,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990629323] [2021-06-05 04:26:03,764 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:03,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:03,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:03,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:03,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:03,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:03,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:03,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:03,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:03,967 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:03,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:03,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:03,971 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:03,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:03,999 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:03,999 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:99 [2021-06-05 04:26:04,155 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_418, array_2, v_prenex_420, v_prenex_422], 1=[v_prenex_417, array_0, v_prenex_419, v_prenex_421]} [2021-06-05 04:26:04,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:04,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:04,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:04,165 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:04,229 INFO L628 ElimStorePlain]: treesize reduction 117, result has 45.1 percent of original size [2021-06-05 04:26:04,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:04,233 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:04,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:04,254 INFO L518 ElimStorePlain]: Eliminatee v_prenex_420 vanished before elimination [2021-06-05 04:26:04,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:04,258 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:04,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:04,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:04,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:04,283 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:04,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:04,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:04,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:04,307 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:04,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:04,326 INFO L518 ElimStorePlain]: Eliminatee v_prenex_419 vanished before elimination [2021-06-05 04:26:04,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:04,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:04,330 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:04,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:04,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:04,351 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 04:26:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:04,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990629323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:04,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:04,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:26:04,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176494385] [2021-06-05 04:26:04,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:04,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:04,394 INFO L87 Difference]: Start difference. First operand 366 states and 1168 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:04,913 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2021-06-05 04:26:05,285 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2021-06-05 04:26:05,590 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 109 [2021-06-05 04:26:05,830 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2021-06-05 04:26:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:05,903 INFO L93 Difference]: Finished difference Result 600 states and 1826 transitions. [2021-06-05 04:26:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:26:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:05,905 INFO L225 Difference]: With dead ends: 600 [2021-06-05 04:26:05,905 INFO L226 Difference]: Without dead ends: 582 [2021-06-05 04:26:05,905 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1602.6ms TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:26:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-06-05 04:26:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2021-06-05 04:26:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.2085561497326203) internal successors, (1200), 374 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1200 transitions. [2021-06-05 04:26:05,910 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1200 transitions. Word has length 17 [2021-06-05 04:26:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:05,910 INFO L482 AbstractCegarLoop]: Abstraction has 375 states and 1200 transitions. [2021-06-05 04:26:05,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1200 transitions. [2021-06-05 04:26:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:05,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:05,910 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:06,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1502 [2021-06-05 04:26:06,111 INFO L430 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 61528026, now seen corresponding path program 56 times [2021-06-05 04:26:06,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:06,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013938206] [2021-06-05 04:26:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:06,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:06,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013938206] [2021-06-05 04:26:06,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013938206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:06,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613479705] [2021-06-05 04:26:06,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:06,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:06,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:06,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:06,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:06,591 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_424], 3=[array_0]} [2021-06-05 04:26:06,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:06,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:06,600 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:06,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:06,636 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:06,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:06,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:06,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:06,672 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:119 [2021-06-05 04:26:06,800 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_427, v_prenex_429, array_2, v_prenex_431], 1=[v_prenex_428, array_4, v_prenex_430, v_prenex_432]} [2021-06-05 04:26:06,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:26:06,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:06,809 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,894 INFO L628 ElimStorePlain]: treesize reduction 96, result has 61.0 percent of original size [2021-06-05 04:26:06,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:06,898 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:06,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:06,936 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:06,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:06,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:06,971 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:07,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:07,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:07,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:07,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:07,007 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:07,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:07,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:07,011 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:07,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:07,041 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:26:07,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:07,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:07,046 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:07,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:07,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:07,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:26:07,078 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:07,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:07,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:07,109 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:265, output treesize:48 [2021-06-05 04:26:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:07,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613479705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:07,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:07,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:26:07,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716865960] [2021-06-05 04:26:07,157 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:07,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:07,158 INFO L87 Difference]: Start difference. First operand 375 states and 1200 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:07,658 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 04:26:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:07,759 INFO L93 Difference]: Finished difference Result 435 states and 1364 transitions. [2021-06-05 04:26:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:07,760 INFO L225 Difference]: With dead ends: 435 [2021-06-05 04:26:07,760 INFO L226 Difference]: Without dead ends: 425 [2021-06-05 04:26:07,760 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 764.0ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-06-05 04:26:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 378. [2021-06-05 04:26:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 04:26:07,764 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 04:26:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:07,764 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 04:26:07,764 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 04:26:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:07,765 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:07,765 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:07,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1527,203 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:07,965 INFO L430 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1542765896, now seen corresponding path program 57 times [2021-06-05 04:26:07,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:07,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723608337] [2021-06-05 04:26:07,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:08,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:08,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723608337] [2021-06-05 04:26:08,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723608337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:08,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170766508] [2021-06-05 04:26:08,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:08,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:26:08,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:08,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:08,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:08,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:08,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:08,311 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:08,343 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:08,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:08,370 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:96 [2021-06-05 04:26:08,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:08,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,587 INFO L628 ElimStorePlain]: treesize reduction 114, result has 48.6 percent of original size [2021-06-05 04:26:08,587 INFO L518 ElimStorePlain]: Eliminatee v_prenex_438 vanished before elimination [2021-06-05 04:26:08,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:08,591 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:08,618 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:08,643 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:08,668 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:08,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:08,692 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:08,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:08,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:08,715 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:08,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:08,742 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:08,742 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:233, output treesize:38 [2021-06-05 04:26:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:08,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170766508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:08,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:08,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:08,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086441823] [2021-06-05 04:26:08,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:08,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:08,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:08,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:08,779 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:09,347 INFO L93 Difference]: Finished difference Result 433 states and 1360 transitions. [2021-06-05 04:26:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:09,348 INFO L225 Difference]: With dead ends: 433 [2021-06-05 04:26:09,348 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 04:26:09,348 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 672.8ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:26:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 04:26:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 377. [2021-06-05 04:26:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.2074468085106385) internal successors, (1206), 376 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1206 transitions. [2021-06-05 04:26:09,352 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1206 transitions. Word has length 17 [2021-06-05 04:26:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:09,352 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1206 transitions. [2021-06-05 04:26:09,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1206 transitions. [2021-06-05 04:26:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:09,353 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:09,353 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:09,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1556 [2021-06-05 04:26:09,553 INFO L430 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:09,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2091682306, now seen corresponding path program 58 times [2021-06-05 04:26:09,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:09,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366996249] [2021-06-05 04:26:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:10,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:10,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366996249] [2021-06-05 04:26:10,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366996249] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:10,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857720050] [2021-06-05 04:26:10,058 INFO L93 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 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:10,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:26:10,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:10,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:10,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:10,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:10,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:10,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:10,197 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:10,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:10,201 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:10,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:10,250 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:157 [2021-06-05 04:26:10,609 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_459, array_2, v_prenex_451, v_prenex_453, v_prenex_455, v_prenex_457], 1=[v_prenex_460, array_4, v_prenex_452, v_prenex_454, v_prenex_456, v_prenex_458]} [2021-06-05 04:26:10,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:10,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:26:10,621 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,768 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2021-06-05 04:26:10,768 INFO L628 ElimStorePlain]: treesize reduction 187, result has 52.2 percent of original size [2021-06-05 04:26:10,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:10,773 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:10,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:10,829 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:10,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:10,884 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:10,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:10,938 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:10,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:10,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:10,990 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:11,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:11,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:11,043 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:11,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:26:11,048 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:11,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:11,103 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:26:11,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:11,107 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:11,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:11,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:11,156 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:11,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:11,200 INFO L518 ElimStorePlain]: Eliminatee v_prenex_456 vanished before elimination [2021-06-05 04:26:11,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:11,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:11,204 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:11,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:11,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:26:11,248 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:411, output treesize:69 [2021-06-05 04:26:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:11,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857720050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:11,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:11,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:11,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176202450] [2021-06-05 04:26:11,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:11,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:11,305 INFO L87 Difference]: Start difference. First operand 377 states and 1206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:11,759 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 04:26:11,951 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2021-06-05 04:26:12,256 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2021-06-05 04:26:12,557 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 116 [2021-06-05 04:26:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:12,646 INFO L93 Difference]: Finished difference Result 436 states and 1366 transitions. [2021-06-05 04:26:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:26:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:12,647 INFO L225 Difference]: With dead ends: 436 [2021-06-05 04:26:12,647 INFO L226 Difference]: Without dead ends: 426 [2021-06-05 04:26:12,647 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1773.8ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:26:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-06-05 04:26:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 379. [2021-06-05 04:26:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2063492063492065) internal successors, (1212), 378 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1212 transitions. [2021-06-05 04:26:12,655 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1212 transitions. Word has length 17 [2021-06-05 04:26:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:12,655 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1212 transitions. [2021-06-05 04:26:12,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1212 transitions. [2021-06-05 04:26:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:12,655 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:12,655 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:12,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1597,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:12,856 INFO L430 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1276876152, now seen corresponding path program 59 times [2021-06-05 04:26:12,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:12,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004097593] [2021-06-05 04:26:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:13,091 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 04:26:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:13,364 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:13,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004097593] [2021-06-05 04:26:13,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004097593] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:13,364 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431643245] [2021-06-05 04:26:13,364 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:13,391 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:26:13,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:13,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:13,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:13,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:13,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:13,526 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:13,566 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:13,569 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:13,603 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:107 [2021-06-05 04:26:13,708 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_471, v_prenex_467, v_prenex_469], 1=[array_0, v_prenex_470, v_prenex_466, v_prenex_468]} [2021-06-05 04:26:13,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:13,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:13,717 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,779 INFO L628 ElimStorePlain]: treesize reduction 117, result has 46.6 percent of original size [2021-06-05 04:26:13,780 INFO L518 ElimStorePlain]: Eliminatee v_prenex_471 vanished before elimination [2021-06-05 04:26:13,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:13,783 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:13,808 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:13,831 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:13,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,850 INFO L518 ElimStorePlain]: Eliminatee v_prenex_470 vanished before elimination [2021-06-05 04:26:13,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:13,854 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:13,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:13,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:13,877 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:13,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:13,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:13,910 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 04:26:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:13,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431643245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:13,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:13,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:26:13,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809654476] [2021-06-05 04:26:13,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:13,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:13,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:13,949 INFO L87 Difference]: Start difference. First operand 379 states and 1212 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:14,397 INFO L93 Difference]: Finished difference Result 429 states and 1350 transitions. [2021-06-05 04:26:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:26:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:14,398 INFO L225 Difference]: With dead ends: 429 [2021-06-05 04:26:14,398 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 04:26:14,398 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 834.3ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:26:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 04:26:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 378. [2021-06-05 04:26:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 04:26:14,402 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 04:26:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:14,402 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 04:26:14,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 04:26:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:14,403 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:14,403 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:14,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1628,206 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:14,604 INFO L430 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1996192008, now seen corresponding path program 60 times [2021-06-05 04:26:14,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:14,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786587808] [2021-06-05 04:26:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:14,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:14,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786587808] [2021-06-05 04:26:14,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786587808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:14,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015071405] [2021-06-05 04:26:14,921 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:14,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:26:14,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:14,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:14,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:15,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:15,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:15,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,057 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:15,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:15,061 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:15,063 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:15,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:15,088 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:96 [2021-06-05 04:26:15,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:15,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:15,191 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:15,197 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,276 INFO L628 ElimStorePlain]: treesize reduction 127, result has 43.8 percent of original size [2021-06-05 04:26:15,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:15,282 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:15,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:15,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:15,337 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:15,341 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:15,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:15,372 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:15,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:15,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:15,376 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:15,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:15,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:15,401 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:257, output treesize:38 [2021-06-05 04:26:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:15,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015071405] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:15,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:15,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:15,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847471036] [2021-06-05 04:26:15,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:15,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:15,438 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:16,022 INFO L93 Difference]: Finished difference Result 432 states and 1360 transitions. [2021-06-05 04:26:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:16,023 INFO L225 Difference]: With dead ends: 432 [2021-06-05 04:26:16,023 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 04:26:16,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 760.6ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 04:26:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-06-05 04:26:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 04:26:16,027 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 04:26:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:16,027 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 04:26:16,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 04:26:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:16,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:16,028 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:16,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1653 [2021-06-05 04:26:16,228 INFO L430 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1653608496, now seen corresponding path program 61 times [2021-06-05 04:26:16,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:16,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204640018] [2021-06-05 04:26:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:16,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:16,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204640018] [2021-06-05 04:26:16,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204640018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:16,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301559028] [2021-06-05 04:26:16,441 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:16,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:16,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:16,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:16,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:16,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:16,617 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:16,620 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:16,651 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 04:26:16,763 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_481, v_prenex_483, v_prenex_485], 1=[array_0, v_prenex_480, v_prenex_482, v_prenex_484]} [2021-06-05 04:26:16,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:26:16,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:16,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,837 INFO L628 ElimStorePlain]: treesize reduction 112, result has 47.7 percent of original size [2021-06-05 04:26:16,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:16,841 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,862 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,862 INFO L518 ElimStorePlain]: Eliminatee v_prenex_483 vanished before elimination [2021-06-05 04:26:16,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:16,866 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:16,889 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:16,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:26:16,913 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:16,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,932 INFO L518 ElimStorePlain]: Eliminatee v_prenex_482 vanished before elimination [2021-06-05 04:26:16,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:16,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:16,936 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:16,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:16,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:16,957 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 04:26:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:16,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301559028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:16,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:16,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:16,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417447442] [2021-06-05 04:26:16,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:16,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:16,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:16,998 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:17,488 INFO L93 Difference]: Finished difference Result 430 states and 1354 transitions. [2021-06-05 04:26:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:26:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:17,489 INFO L225 Difference]: With dead ends: 430 [2021-06-05 04:26:17,489 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 04:26:17,489 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 603.3ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 04:26:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 378. [2021-06-05 04:26:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 04:26:17,493 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 04:26:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:17,493 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 04:26:17,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 04:26:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:17,494 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:17,494 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:17,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1665,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:17,694 INFO L430 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1205884026, now seen corresponding path program 62 times [2021-06-05 04:26:17,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:17,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78891592] [2021-06-05 04:26:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:18,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:18,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78891592] [2021-06-05 04:26:18,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78891592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:18,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751486747] [2021-06-05 04:26:18,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:18,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:18,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:18,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:18,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:18,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:18,252 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:18,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:18,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:18,281 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,300 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:18,300 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 04:26:18,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:18,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,391 INFO L628 ElimStorePlain]: treesize reduction 46, result has 57.4 percent of original size [2021-06-05 04:26:18,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:18,394 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:18,410 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:18,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:18,428 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:18,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:18,442 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:18,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:18,453 INFO L518 ElimStorePlain]: Eliminatee v_prenex_489 vanished before elimination [2021-06-05 04:26:18,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:18,454 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 04:26:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:18,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751486747] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:18,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:18,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:26:18,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660119614] [2021-06-05 04:26:18,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:18,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:18,488 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:19,102 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-06-05 04:26:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:19,177 INFO L93 Difference]: Finished difference Result 456 states and 1422 transitions. [2021-06-05 04:26:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:19,178 INFO L225 Difference]: With dead ends: 456 [2021-06-05 04:26:19,178 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 04:26:19,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 935.9ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:26:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 04:26:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 382. [2021-06-05 04:26:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.2073490813648293) internal successors, (1222), 381 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1222 transitions. [2021-06-05 04:26:19,183 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1222 transitions. Word has length 17 [2021-06-05 04:26:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:19,183 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1222 transitions. [2021-06-05 04:26:19,183 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1222 transitions. [2021-06-05 04:26:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:19,183 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:19,183 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:19,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1698 [2021-06-05 04:26:19,384 INFO L430 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash 391077872, now seen corresponding path program 63 times [2021-06-05 04:26:19,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:19,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180604227] [2021-06-05 04:26:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:19,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:19,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180604227] [2021-06-05 04:26:19,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180604227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:19,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862433991] [2021-06-05 04:26:19,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:19,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:26:19,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:19,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:19,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:19,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:19,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:19,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:19,888 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:19,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:19,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:19,940 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:19,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:19,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:19,945 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:19,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:19,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:19,991 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:162 [2021-06-05 04:26:20,114 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 04:26:20,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:20,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:20,125 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:20,130 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:20,134 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:20,140 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:20,145 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:20,151 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:26:20,155 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,292 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-06-05 04:26:20,292 INFO L628 ElimStorePlain]: treesize reduction 142, result has 58.0 percent of original size [2021-06-05 04:26:20,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:20,297 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:20,301 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:26:20,306 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:20,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:20,310 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:20,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:20,363 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:20,363 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:411, output treesize:103 [2021-06-05 04:26:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:20,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862433991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:20,490 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:20,490 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:20,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735613616] [2021-06-05 04:26:20,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:20,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:20,491 INFO L87 Difference]: Start difference. First operand 382 states and 1222 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:21,094 INFO L93 Difference]: Finished difference Result 456 states and 1426 transitions. [2021-06-05 04:26:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:21,095 INFO L225 Difference]: With dead ends: 456 [2021-06-05 04:26:21,095 INFO L226 Difference]: Without dead ends: 443 [2021-06-05 04:26:21,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 834.9ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:26:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-06-05 04:26:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 380. [2021-06-05 04:26:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 04:26:21,099 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 04:26:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:21,100 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 04:26:21,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 04:26:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:21,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:21,100 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:21,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1707,210 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:21,301 INFO L430 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 981448970, now seen corresponding path program 64 times [2021-06-05 04:26:21,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:21,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918280354] [2021-06-05 04:26:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:21,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:21,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918280354] [2021-06-05 04:26:21,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918280354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:21,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090696235] [2021-06-05 04:26:21,514 INFO L93 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 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:21,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:26:21,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:21,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:21,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:21,675 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:21,715 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:21,719 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:21,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:21,754 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:130 [2021-06-05 04:26:21,933 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 04:26:21,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:21,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:21,944 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:21,948 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:21,953 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:21,958 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:26:21,963 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:21,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:21,985 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:21,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:21,991 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:22,128 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2021-06-05 04:26:22,129 INFO L628 ElimStorePlain]: treesize reduction 154, result has 54.6 percent of original size [2021-06-05 04:26:22,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:22,134 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:22,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:22,139 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:22,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:22,143 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:22,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:22,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:22,147 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:22,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:22,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:22,201 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:411, output treesize:101 [2021-06-05 04:26:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:22,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090696235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:22,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:22,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:22,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066851260] [2021-06-05 04:26:22,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:22,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:22,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:22,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:22,320 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:22,948 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 89 [2021-06-05 04:26:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:23,125 INFO L93 Difference]: Finished difference Result 508 states and 1579 transitions. [2021-06-05 04:26:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:23,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:23,131 INFO L225 Difference]: With dead ends: 508 [2021-06-05 04:26:23,131 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 04:26:23,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 905.8ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:26:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 04:26:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 379. [2021-06-05 04:26:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2116402116402116) internal successors, (1214), 378 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1214 transitions. [2021-06-05 04:26:23,148 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1214 transitions. Word has length 17 [2021-06-05 04:26:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:23,148 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1214 transitions. [2021-06-05 04:26:23,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1214 transitions. [2021-06-05 04:26:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:23,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:23,149 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:23,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1731,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:23,349 INFO L430 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash 527178728, now seen corresponding path program 65 times [2021-06-05 04:26:23,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:23,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353673401] [2021-06-05 04:26:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:23,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:23,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353673401] [2021-06-05 04:26:23,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353673401] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:23,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574026838] [2021-06-05 04:26:23,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:23,700 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:26:23,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:23,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:23,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:23,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:23,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:23,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:23,795 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:23,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:23,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:23,825 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:23,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:23,828 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:23,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:23,851 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:23,851 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:86 [2021-06-05 04:26:23,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:23,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:23,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:23,998 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:24,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:24,003 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:24,067 INFO L628 ElimStorePlain]: treesize reduction 108, result has 45.7 percent of original size [2021-06-05 04:26:24,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:24,072 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:24,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:24,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:24,098 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:24,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:24,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:26:24,122 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:24,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:24,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:24,145 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:24,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:24,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:24,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:24,168 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:24,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:24,187 INFO L518 ElimStorePlain]: Eliminatee v_prenex_501 vanished before elimination [2021-06-05 04:26:24,187 INFO L518 ElimStorePlain]: Eliminatee v_prenex_502 vanished before elimination [2021-06-05 04:26:24,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:24,189 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:213, output treesize:38 [2021-06-05 04:26:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:24,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574026838] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:24,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:24,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:24,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174735582] [2021-06-05 04:26:24,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:24,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:24,227 INFO L87 Difference]: Start difference. First operand 379 states and 1214 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:24,752 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 04:26:25,023 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2021-06-05 04:26:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:25,095 INFO L93 Difference]: Finished difference Result 451 states and 1418 transitions. [2021-06-05 04:26:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:25,096 INFO L225 Difference]: With dead ends: 451 [2021-06-05 04:26:25,096 INFO L226 Difference]: Without dead ends: 441 [2021-06-05 04:26:25,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1026.5ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:26:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-06-05 04:26:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2021-06-05 04:26:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.2094240837696337) internal successors, (1226), 382 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1226 transitions. [2021-06-05 04:26:25,100 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1226 transitions. Word has length 17 [2021-06-05 04:26:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:25,100 INFO L482 AbstractCegarLoop]: Abstraction has 383 states and 1226 transitions. [2021-06-05 04:26:25,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1226 transitions. [2021-06-05 04:26:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:25,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:25,101 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:25,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 212 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1755 [2021-06-05 04:26:25,301 INFO L430 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash 869762240, now seen corresponding path program 66 times [2021-06-05 04:26:25,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:25,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058946396] [2021-06-05 04:26:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:25,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:25,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058946396] [2021-06-05 04:26:25,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058946396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:25,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853130495] [2021-06-05 04:26:25,570 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:25,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 04:26:25,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:25,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:25,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:25,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:25,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:25,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:25,735 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:25,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:25,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:25,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:25,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:25,747 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:25,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:25,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:25,810 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 04:26:25,950 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_515, array_2, v_prenex_511, v_prenex_513], 1=[v_prenex_514, array_0, v_prenex_510, v_prenex_512]} [2021-06-05 04:26:25,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:25,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:25,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:25,961 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,136 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-06-05 04:26:26,136 INFO L628 ElimStorePlain]: treesize reduction 155, result has 55.6 percent of original size [2021-06-05 04:26:26,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:26,141 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:26,216 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:26,276 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:26:26,279 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,328 INFO L518 ElimStorePlain]: Eliminatee v_prenex_514 vanished before elimination [2021-06-05 04:26:26,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:26,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:26,332 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:26,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:26,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:26,384 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:26,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:26,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:26,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:26,436 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:26,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:26,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:26,440 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:26,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:26,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:26,487 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:367, output treesize:122 [2021-06-05 04:26:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:26,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853130495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:26,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:26,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:26,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743932375] [2021-06-05 04:26:26,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:26,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:26,621 INFO L87 Difference]: Start difference. First operand 383 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:27,127 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-06-05 04:26:27,285 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-06-05 04:26:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:27,364 INFO L93 Difference]: Finished difference Result 449 states and 1412 transitions. [2021-06-05 04:26:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:27,365 INFO L225 Difference]: With dead ends: 449 [2021-06-05 04:26:27,365 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 04:26:27,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 959.5ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:26:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 04:26:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 381. [2021-06-05 04:26:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 04:26:27,369 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 04:26:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:27,369 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 04:26:27,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 04:26:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:27,369 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:27,369 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:27,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1797,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:27,570 INFO L430 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:27,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1237021880, now seen corresponding path program 67 times [2021-06-05 04:26:27,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:27,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135768086] [2021-06-05 04:26:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:27,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:27,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135768086] [2021-06-05 04:26:27,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135768086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:27,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578559802] [2021-06-05 04:26:27,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:27,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:27,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:27,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:27,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:27,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:27,883 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:27,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:27,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:27,914 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:27,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:27,918 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:27,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:27,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:27,945 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:101 [2021-06-05 04:26:28,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:26:28,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:28,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:28,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:28,174 INFO L628 ElimStorePlain]: treesize reduction 112, result has 47.7 percent of original size [2021-06-05 04:26:28,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:28,178 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:28,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:28,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:28,203 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:28,225 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:28,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:28,228 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:28,247 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:28,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:26:28,252 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:28,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:28,271 INFO L518 ElimStorePlain]: Eliminatee v_prenex_522 vanished before elimination [2021-06-05 04:26:28,271 INFO L518 ElimStorePlain]: Eliminatee v_prenex_523 vanished before elimination [2021-06-05 04:26:28,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:28,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:28,274 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:28,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:28,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:28,295 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 04:26:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:28,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578559802] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:28,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:28,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 04:26:28,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529150311] [2021-06-05 04:26:28,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:26:28,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:26:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:26:28,334 INFO L87 Difference]: Start difference. First operand 381 states and 1220 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:28,897 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-06-05 04:26:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:29,221 INFO L93 Difference]: Finished difference Result 487 states and 1515 transitions. [2021-06-05 04:26:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:29,223 INFO L225 Difference]: With dead ends: 487 [2021-06-05 04:26:29,223 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 04:26:29,223 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 920.8ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 04:26:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 381. [2021-06-05 04:26:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 04:26:29,227 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 04:26:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:29,227 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 04:26:29,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 04:26:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:29,228 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:29,228 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:29,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1818,214 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:29,428 INFO L430 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -176185004, now seen corresponding path program 68 times [2021-06-05 04:26:29,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:29,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489338964] [2021-06-05 04:26:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:29,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:29,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489338964] [2021-06-05 04:26:29,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489338964] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:29,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68669702] [2021-06-05 04:26:29,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:29,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:29,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:29,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:29,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:29,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:29,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:29,788 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:29,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:29,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:29,792 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:29,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:29,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:29,796 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:29,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:29,799 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:29,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:29,851 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:29,851 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 04:26:30,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:30,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:30,083 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:30,087 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:30,092 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,194 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2021-06-05 04:26:30,194 INFO L628 ElimStorePlain]: treesize reduction 172, result has 46.9 percent of original size [2021-06-05 04:26:30,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:30,198 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:30,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:30,239 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:30,243 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:26:30,246 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:30,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:30,282 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:30,286 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:30,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:30,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:30,289 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:30,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:30,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:26:30,321 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:354, output treesize:62 [2021-06-05 04:26:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:30,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68669702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:30,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:30,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:30,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353092623] [2021-06-05 04:26:30,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:30,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:30,370 INFO L87 Difference]: Start difference. First operand 381 states and 1220 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:31,123 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2021-06-05 04:26:31,452 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2021-06-05 04:26:31,643 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2021-06-05 04:26:31,877 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2021-06-05 04:26:32,158 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2021-06-05 04:26:32,404 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2021-06-05 04:26:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:32,466 INFO L93 Difference]: Finished difference Result 476 states and 1470 transitions. [2021-06-05 04:26:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:26:32,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:32,467 INFO L225 Difference]: With dead ends: 476 [2021-06-05 04:26:32,467 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 04:26:32,467 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2199.0ms TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:26:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 04:26:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2021-06-05 04:26:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.1984334203655354) internal successors, (1225), 383 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1225 transitions. [2021-06-05 04:26:32,471 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1225 transitions. Word has length 17 [2021-06-05 04:26:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:32,471 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1225 transitions. [2021-06-05 04:26:32,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1225 transitions. [2021-06-05 04:26:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:32,472 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:32,472 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:32,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1848,215 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:32,672 INFO L430 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:32,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1305052866, now seen corresponding path program 69 times [2021-06-05 04:26:32,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:32,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538783228] [2021-06-05 04:26:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:32,922 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:32,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538783228] [2021-06-05 04:26:32,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538783228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:32,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355501811] [2021-06-05 04:26:32,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:32,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:26:32,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:32,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:32,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:33,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:33,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:33,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,129 INFO L628 ElimStorePlain]: treesize reduction 10, result has 92.1 percent of original size [2021-06-05 04:26:33,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:33,134 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:33,137 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,167 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:33,167 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:102 [2021-06-05 04:26:33,270 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_537, array_0, v_prenex_533, v_prenex_535], 1=[v_prenex_536, v_prenex_538, array_4, v_prenex_534]} [2021-06-05 04:26:33,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:33,275 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:33,282 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,368 INFO L628 ElimStorePlain]: treesize reduction 85, result has 61.9 percent of original size [2021-06-05 04:26:33,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:33,373 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:33,410 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:26:33,445 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:26:33,448 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:33,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:33,481 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:33,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:33,486 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:33,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,513 INFO L518 ElimStorePlain]: Eliminatee v_prenex_538 vanished before elimination [2021-06-05 04:26:33,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:33,518 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:33,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:33,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:33,548 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:33,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:33,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:33,576 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:241, output treesize:48 [2021-06-05 04:26:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:33,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355501811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:33,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:33,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:33,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537272993] [2021-06-05 04:26:33,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:33,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:33,629 INFO L87 Difference]: Start difference. First operand 384 states and 1225 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:34,621 INFO L93 Difference]: Finished difference Result 475 states and 1475 transitions. [2021-06-05 04:26:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:26:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:34,622 INFO L225 Difference]: With dead ends: 475 [2021-06-05 04:26:34,622 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 04:26:34,622 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1042.4ms TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:26:34,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 04:26:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 381. [2021-06-05 04:26:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 04:26:34,626 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 04:26:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:34,627 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 04:26:34,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 04:26:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:34,627 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:34,627 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:34,827 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 216 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1861 [2021-06-05 04:26:34,828 INFO L430 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 733598060, now seen corresponding path program 70 times [2021-06-05 04:26:34,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:34,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53908990] [2021-06-05 04:26:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:35,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:35,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53908990] [2021-06-05 04:26:35,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53908990] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:35,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252301891] [2021-06-05 04:26:35,063 INFO L93 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 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:35,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:26:35,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:35,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:35,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:35,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:35,264 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:35,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:35,345 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:35,349 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:35,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:35,412 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:35,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:35,416 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:35,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:26:35,475 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:239, output treesize:188 [2021-06-05 04:26:35,761 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_548, array_0, v_prenex_550, v_prenex_552, v_prenex_554, v_prenex_546], 1=[v_prenex_547, v_prenex_549, array_4, v_prenex_551, v_prenex_553, v_prenex_555]} [2021-06-05 04:26:35,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:35,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:35,777 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,929 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 88 [2021-06-05 04:26:35,929 INFO L628 ElimStorePlain]: treesize reduction 194, result has 51.6 percent of original size [2021-06-05 04:26:35,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:26:35,935 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:26:35,939 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:35,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:35,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:35,994 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:36,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:36,048 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:36,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:36,100 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:36,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:36,150 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:36,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:36,200 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:36,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,245 INFO L518 ElimStorePlain]: Eliminatee v_prenex_549 vanished before elimination [2021-06-05 04:26:36,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:36,251 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:36,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:36,256 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:36,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:36,305 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:36,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,349 INFO L518 ElimStorePlain]: Eliminatee v_prenex_553 vanished before elimination [2021-06-05 04:26:36,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:36,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:36,354 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:36,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:36,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:26:36,399 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:415, output treesize:67 [2021-06-05 04:26:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:36,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252301891] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:36,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:36,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:36,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314674392] [2021-06-05 04:26:36,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:36,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:36,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:36,468 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:37,401 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2021-06-05 04:26:37,592 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2021-06-05 04:26:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:37,659 INFO L93 Difference]: Finished difference Result 488 states and 1491 transitions. [2021-06-05 04:26:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:26:37,659 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:37,660 INFO L225 Difference]: With dead ends: 488 [2021-06-05 04:26:37,660 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 04:26:37,660 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1313.3ms TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:26:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 04:26:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 379. [2021-06-05 04:26:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2037037037037037) internal successors, (1211), 378 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1211 transitions. [2021-06-05 04:26:37,665 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1211 transitions. Word has length 17 [2021-06-05 04:26:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:37,665 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1211 transitions. [2021-06-05 04:26:37,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1211 transitions. [2021-06-05 04:26:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:37,665 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:37,665 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:37,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1891 [2021-06-05 04:26:37,866 INFO L430 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -271217144, now seen corresponding path program 71 times [2021-06-05 04:26:37,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:37,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335350190] [2021-06-05 04:26:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:38,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:38,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335350190] [2021-06-05 04:26:38,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335350190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:38,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541481963] [2021-06-05 04:26:38,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:38,248 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:38,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:38,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 04:26:38,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:38,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:38,360 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:38,363 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:38,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:38,401 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:38,405 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:38,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:38,437 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:112 [2021-06-05 04:26:38,629 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 04:26:38,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:38,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:38,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:38,644 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:38,649 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:38,654 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:38,659 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:26:38,664 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:38,668 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,823 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 04:26:38,823 INFO L628 ElimStorePlain]: treesize reduction 145, result has 58.7 percent of original size [2021-06-05 04:26:38,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:38,828 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:38,833 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:38,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:38,838 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:38,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:38,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:38,842 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:38,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:38,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:38,903 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:415, output treesize:128 [2021-06-05 04:26:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:39,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541481963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:39,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:39,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:39,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671156924] [2021-06-05 04:26:39,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:39,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:39,075 INFO L87 Difference]: Start difference. First operand 379 states and 1211 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:39,864 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2021-06-05 04:26:40,029 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2021-06-05 04:26:40,266 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2021-06-05 04:26:40,520 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2021-06-05 04:26:40,844 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 112 [2021-06-05 04:26:41,145 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2021-06-05 04:26:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:41,256 INFO L93 Difference]: Finished difference Result 587 states and 1781 transitions. [2021-06-05 04:26:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:26:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:41,258 INFO L225 Difference]: With dead ends: 587 [2021-06-05 04:26:41,258 INFO L226 Difference]: Without dead ends: 566 [2021-06-05 04:26:41,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2189.1ms TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:26:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-06-05 04:26:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 378. [2021-06-05 04:26:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2015915119363396) internal successors, (1207), 377 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1207 transitions. [2021-06-05 04:26:41,262 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1207 transitions. Word has length 17 [2021-06-05 04:26:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:41,263 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1207 transitions. [2021-06-05 04:26:41,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1207 transitions. [2021-06-05 04:26:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:41,263 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:41,263 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:41,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1935,218 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:41,464 INFO L430 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:41,465 INFO L82 PathProgramCache]: Analyzing trace with hash 692518350, now seen corresponding path program 72 times [2021-06-05 04:26:41,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:41,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894233295] [2021-06-05 04:26:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:41,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:41,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894233295] [2021-06-05 04:26:41,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894233295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:41,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100218272] [2021-06-05 04:26:41,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:41,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:26:41,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:41,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:41,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:41,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:41,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:41,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:41,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:41,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:41,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:41,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:41,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:41,958 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:41,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:41,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:41,983 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:97 [2021-06-05 04:26:42,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:42,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:42,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:26:42,145 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:42,216 INFO L628 ElimStorePlain]: treesize reduction 120, result has 45.9 percent of original size [2021-06-05 04:26:42,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:42,220 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:42,242 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:42,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:42,246 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:42,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:42,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:42,272 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:42,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:42,292 INFO L518 ElimStorePlain]: Eliminatee v_prenex_564 vanished before elimination [2021-06-05 04:26:42,292 INFO L518 ElimStorePlain]: Eliminatee v_prenex_565 vanished before elimination [2021-06-05 04:26:42,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:42,296 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:42,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:42,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:42,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:26:42,318 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:42,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:42,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:42,339 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 04:26:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:42,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100218272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:42,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:42,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:26:42,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865972817] [2021-06-05 04:26:42,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:42,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:42,375 INFO L87 Difference]: Start difference. First operand 378 states and 1207 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:43,041 INFO L93 Difference]: Finished difference Result 445 states and 1384 transitions. [2021-06-05 04:26:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:43,042 INFO L225 Difference]: With dead ends: 445 [2021-06-05 04:26:43,042 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 04:26:43,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 856.5ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:26:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 04:26:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 380. [2021-06-05 04:26:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 04:26:43,046 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 04:26:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:43,047 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 04:26:43,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 04:26:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:43,047 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:43,047 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:43,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1961 [2021-06-05 04:26:43,248 INFO L430 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:43,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2121211076, now seen corresponding path program 73 times [2021-06-05 04:26:43,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:43,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923666670] [2021-06-05 04:26:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:43,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:43,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923666670] [2021-06-05 04:26:43,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923666670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:43,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384326416] [2021-06-05 04:26:43,428 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:43,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:43,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:43,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:43,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:43,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:43,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,743 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:43,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:43,748 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:43,752 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:43,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:43,755 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:43,861 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2021-06-05 04:26:43,861 INFO L628 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2021-06-05 04:26:43,865 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:26:43,866 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:239, output treesize:186 [2021-06-05 04:26:44,036 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_580, v_prenex_582, v_prenex_584, v_prenex_576, v_prenex_578], 1=[v_prenex_581, array_4, v_prenex_583, v_prenex_585, v_prenex_577, v_prenex_579]} [2021-06-05 04:26:44,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:44,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:26:44,052 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,242 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 04:26:44,243 INFO L628 ElimStorePlain]: treesize reduction 204, result has 51.2 percent of original size [2021-06-05 04:26:44,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:44,250 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:44,325 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:44,398 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:44,469 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:44,530 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:44,583 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:44,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:44,636 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:44,640 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:44,696 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:44,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:44,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:44,744 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:44,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:44,787 INFO L518 ElimStorePlain]: Eliminatee v_prenex_577 vanished before elimination [2021-06-05 04:26:44,787 INFO L518 ElimStorePlain]: Eliminatee v_prenex_579 vanished before elimination [2021-06-05 04:26:44,789 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:26:44,789 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:430, output treesize:67 [2021-06-05 04:26:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:44,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384326416] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:44,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:44,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:44,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033843395] [2021-06-05 04:26:44,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:44,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:44,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:44,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:44,842 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:45,207 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2021-06-05 04:26:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:45,249 INFO L93 Difference]: Finished difference Result 418 states and 1305 transitions. [2021-06-05 04:26:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:26:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:45,250 INFO L225 Difference]: With dead ends: 418 [2021-06-05 04:26:45,250 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 04:26:45,250 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 603.1ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:26:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 04:26:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 380. [2021-06-05 04:26:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 04:26:45,254 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 04:26:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:45,254 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 04:26:45,254 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 04:26:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:45,255 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:45,255 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:45,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 220 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2003 [2021-06-05 04:26:45,455 INFO L430 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -352509152, now seen corresponding path program 74 times [2021-06-05 04:26:45,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:45,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072379598] [2021-06-05 04:26:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:45,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:45,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072379598] [2021-06-05 04:26:45,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072379598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:45,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124931552] [2021-06-05 04:26:45,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:45,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:45,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:45,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:45,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:45,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:45,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:45,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:45,944 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:45,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:45,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:45,981 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:45,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:45,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:45,984 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:46,015 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:112 [2021-06-05 04:26:46,171 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_590, v_prenex_592, v_prenex_594], 1=[v_prenex_591, array_4, v_prenex_593, v_prenex_595]} [2021-06-05 04:26:46,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:46,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:46,181 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,269 INFO L628 ElimStorePlain]: treesize reduction 89, result has 62.8 percent of original size [2021-06-05 04:26:46,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:26:46,274 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:46,278 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:46,315 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:46,349 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:46,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:46,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:46,385 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:46,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:46,388 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:46,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:46,420 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:46,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,446 INFO L518 ElimStorePlain]: Eliminatee v_prenex_593 vanished before elimination [2021-06-05 04:26:46,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:46,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:46,450 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:46,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:46,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:46,479 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:261, output treesize:48 [2021-06-05 04:26:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:46,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124931552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:46,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:46,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:26:46,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690857291] [2021-06-05 04:26:46,531 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:46,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:46,531 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:47,140 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-06-05 04:26:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:47,241 INFO L93 Difference]: Finished difference Result 450 states and 1397 transitions. [2021-06-05 04:26:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:47,242 INFO L225 Difference]: With dead ends: 450 [2021-06-05 04:26:47,242 INFO L226 Difference]: Without dead ends: 440 [2021-06-05 04:26:47,243 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 879.2ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:26:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-06-05 04:26:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 379. [2021-06-05 04:26:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.201058201058201) internal successors, (1210), 378 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1210 transitions. [2021-06-05 04:26:47,248 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1210 transitions. Word has length 17 [2021-06-05 04:26:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:47,248 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1210 transitions. [2021-06-05 04:26:47,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1210 transitions. [2021-06-05 04:26:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:47,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:47,249 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:47,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2052,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:47,471 INFO L430 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1572294666, now seen corresponding path program 75 times [2021-06-05 04:26:47,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:47,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053270082] [2021-06-05 04:26:47,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:47,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:47,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053270082] [2021-06-05 04:26:47,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053270082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:47,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261833382] [2021-06-05 04:26:47,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:47,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:26:47,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:47,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:48,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:48,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:48,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:48,083 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:48,086 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:48,139 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:48,139 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 04:26:48,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:48,358 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:48,363 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:48,367 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:48,372 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:48,377 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,471 INFO L628 ElimStorePlain]: treesize reduction 179, result has 41.7 percent of original size [2021-06-05 04:26:48,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:48,475 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:48,480 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:48,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:48,484 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:48,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:48,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:48,530 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:48,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:48,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:48,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:48,567 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:48,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:48,601 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:26:48,601 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:344, output treesize:62 [2021-06-05 04:26:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:48,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261833382] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:48,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:48,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:48,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773295995] [2021-06-05 04:26:48,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:48,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:48,650 INFO L87 Difference]: Start difference. First operand 379 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:49,028 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2021-06-05 04:26:49,260 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2021-06-05 04:26:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:49,350 INFO L93 Difference]: Finished difference Result 442 states and 1378 transitions. [2021-06-05 04:26:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:49,351 INFO L225 Difference]: With dead ends: 442 [2021-06-05 04:26:49,351 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 04:26:49,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1116.6ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 04:26:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 381. [2021-06-05 04:26:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 04:26:49,355 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 04:26:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:49,355 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 04:26:49,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 04:26:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:49,355 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:49,356 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:49,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2085,222 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:49,556 INFO L430 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1907866476, now seen corresponding path program 76 times [2021-06-05 04:26:49,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:49,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988370817] [2021-06-05 04:26:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:49,769 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 04:26:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:50,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:50,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988370817] [2021-06-05 04:26:50,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988370817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:50,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368183] [2021-06-05 04:26:50,092 INFO L93 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 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:50,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:26:50,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:50,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:50,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:50,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:50,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:50,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:50,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:50,330 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:50,334 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:50,379 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:50,379 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:180, output treesize:146 [2021-06-05 04:26:50,513 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 04:26:50,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:26:50,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:50,526 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:50,533 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:50,539 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:50,545 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:50,551 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:50,557 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:50,562 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,698 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-06-05 04:26:50,699 INFO L628 ElimStorePlain]: treesize reduction 136, result has 56.8 percent of original size [2021-06-05 04:26:50,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:50,704 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:50,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:50,708 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:50,713 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:50,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:50,717 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:50,768 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:50,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:50,771 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:379, output treesize:101 [2021-06-05 04:26:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:50,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:50,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:50,890 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:26:50,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221048881] [2021-06-05 04:26:50,890 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:26:50,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:26:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:26:50,890 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:51,477 INFO L93 Difference]: Finished difference Result 449 states and 1404 transitions. [2021-06-05 04:26:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:26:51,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:51,478 INFO L225 Difference]: With dead ends: 449 [2021-06-05 04:26:51,478 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 04:26:51,478 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1010.2ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 04:26:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2021-06-05 04:26:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 04:26:51,483 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 04:26:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:51,483 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 04:26:51,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 04:26:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:51,483 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:51,483 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:51,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098,223 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:51,684 INFO L430 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1365201684, now seen corresponding path program 77 times [2021-06-05 04:26:51,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:51,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693481597] [2021-06-05 04:26:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:51,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:51,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693481597] [2021-06-05 04:26:51,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693481597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:51,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027610379] [2021-06-05 04:26:51,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:52,006 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:26:52,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:52,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:26:52,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:52,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:52,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:52,119 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:52,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:52,160 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:52,192 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:112 [2021-06-05 04:26:52,330 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_607, v_prenex_609, v_prenex_611], 1=[v_prenex_608, array_4, v_prenex_610, v_prenex_612]} [2021-06-05 04:26:52,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:52,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:26:52,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,434 INFO L628 ElimStorePlain]: treesize reduction 100, result has 59.8 percent of original size [2021-06-05 04:26:52,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:52,439 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:52,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:52,512 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:52,547 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:52,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:26:52,580 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:52,583 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:52,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:52,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:52,615 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:52,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:52,641 INFO L518 ElimStorePlain]: Eliminatee v_prenex_612 vanished before elimination [2021-06-05 04:26:52,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:52,643 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:261, output treesize:48 [2021-06-05 04:26:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:52,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027610379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:52,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:52,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:26:52,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944452647] [2021-06-05 04:26:52,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:26:52,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:26:52,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:26:52,696 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:53,304 INFO L93 Difference]: Finished difference Result 444 states and 1386 transitions. [2021-06-05 04:26:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:26:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:53,305 INFO L225 Difference]: With dead ends: 444 [2021-06-05 04:26:53,305 INFO L226 Difference]: Without dead ends: 434 [2021-06-05 04:26:53,305 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 746.5ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:26:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-06-05 04:26:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 384. [2021-06-05 04:26:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.2010443864229763) internal successors, (1226), 383 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1226 transitions. [2021-06-05 04:26:53,309 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1226 transitions. Word has length 17 [2021-06-05 04:26:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:53,309 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1226 transitions. [2021-06-05 04:26:53,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1226 transitions. [2021-06-05 04:26:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:53,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:53,310 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:53,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2126 [2021-06-05 04:26:53,510 INFO L430 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1022618172, now seen corresponding path program 78 times [2021-06-05 04:26:53,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:53,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27974638] [2021-06-05 04:26:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:53,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:53,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27974638] [2021-06-05 04:26:53,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27974638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:53,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450164831] [2021-06-05 04:26:53,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:53,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 04:26:53,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:53,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:53,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:53,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:53,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:53,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:53,889 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:53,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:53,893 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:53,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:53,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:53,897 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:53,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:53,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:53,957 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:205, output treesize:167 [2021-06-05 04:26:54,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:54,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:26:54,144 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,294 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2021-06-05 04:26:54,294 INFO L628 ElimStorePlain]: treesize reduction 148, result has 58.1 percent of original size [2021-06-05 04:26:54,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:26:54,299 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:54,364 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:54,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:54,428 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:54,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:26:54,492 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:26:54,497 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:26:54,555 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:54,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:54,560 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:54,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:54,616 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:54,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:54,666 INFO L518 ElimStorePlain]: Eliminatee v_prenex_621 vanished before elimination [2021-06-05 04:26:54,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:54,669 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:371, output treesize:101 [2021-06-05 04:26:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:54,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450164831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:54,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:54,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:54,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446452495] [2021-06-05 04:26:54,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:54,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:54,800 INFO L87 Difference]: Start difference. First operand 384 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:55,198 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2021-06-05 04:26:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:55,404 INFO L93 Difference]: Finished difference Result 442 states and 1380 transitions. [2021-06-05 04:26:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:26:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:55,405 INFO L225 Difference]: With dead ends: 442 [2021-06-05 04:26:55,405 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 04:26:55,405 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 765.8ms TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:26:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 04:26:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 382. [2021-06-05 04:26:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 04:26:55,409 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 04:26:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:55,409 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 04:26:55,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 04:26:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:55,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:55,410 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:55,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2151,225 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:55,632 INFO L430 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1599914564, now seen corresponding path program 79 times [2021-06-05 04:26:55,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:55,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510667374] [2021-06-05 04:26:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:55,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:55,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510667374] [2021-06-05 04:26:55,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510667374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:55,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548994654] [2021-06-05 04:26:55,905 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:55,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:55,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:56,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:56,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:56,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:56,034 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:56,038 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:26:56,094 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:162 [2021-06-05 04:26:56,517 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_635, v_prenex_637, array_0, v_prenex_629, v_prenex_631, v_prenex_633], 1=[v_prenex_636, v_prenex_638, array_4, v_prenex_630, v_prenex_632, v_prenex_634]} [2021-06-05 04:26:56,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:56,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:56,531 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,688 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2021-06-05 04:26:56,688 INFO L628 ElimStorePlain]: treesize reduction 190, result has 54.2 percent of original size [2021-06-05 04:26:56,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:56,694 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:26:56,753 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:56,758 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:56,812 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:56,864 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:26:56,914 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:56,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:56,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:56,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:56,964 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:57,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:57,008 INFO L518 ElimStorePlain]: Eliminatee v_prenex_638 vanished before elimination [2021-06-05 04:26:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:57,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:57,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:57,014 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:57,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:57,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:26:57,018 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:57,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:57,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:57,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:57,067 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:57,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:57,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:26:57,114 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:57,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:57,156 INFO L518 ElimStorePlain]: Eliminatee v_prenex_634 vanished before elimination [2021-06-05 04:26:57,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 04:26:57,158 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:435, output treesize:75 [2021-06-05 04:26:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:57,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548994654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:57,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:26:57,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:26:57,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046726907] [2021-06-05 04:26:57,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:26:57,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:26:57,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:26:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:26:57,221 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:57,877 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 89 [2021-06-05 04:26:58,330 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 142 [2021-06-05 04:26:58,597 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2021-06-05 04:26:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:26:58,691 INFO L93 Difference]: Finished difference Result 543 states and 1673 transitions. [2021-06-05 04:26:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:26:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:26:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:26:58,692 INFO L225 Difference]: With dead ends: 543 [2021-06-05 04:26:58,692 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 04:26:58,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1612.8ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:26:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 04:26:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 426. [2021-06-05 04:26:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.284705882352941) internal successors, (1396), 425 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1396 transitions. [2021-06-05 04:26:58,698 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1396 transitions. Word has length 17 [2021-06-05 04:26:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:26:58,698 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1396 transitions. [2021-06-05 04:26:58,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:26:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1396 transitions. [2021-06-05 04:26:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:26:58,699 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:26:58,699 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:26:58,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2186,226 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:58,915 INFO L430 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:26:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:26:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1275471968, now seen corresponding path program 80 times [2021-06-05 04:26:58,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:26:58,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216070210] [2021-06-05 04:26:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:26:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:26:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:26:59,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:26:59,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216070210] [2021-06-05 04:26:59,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216070210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:26:59,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357984343] [2021-06-05 04:26:59,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:26:59,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:26:59,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:26:59,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:26:59,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:26:59,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:59,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:59,337 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:26:59,341 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:59,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:59,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:26:59,387 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:142 [2021-06-05 04:26:59,546 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_639], 1=[array_4, v_prenex_640]} [2021-06-05 04:26:59,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:26:59,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:26:59,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:59,559 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:26:59,563 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,688 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 04:26:59,688 INFO L628 ElimStorePlain]: treesize reduction 149, result has 56.3 percent of original size [2021-06-05 04:26:59,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:59,692 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:26:59,695 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:26:59,699 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:59,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:26:59,750 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:59,796 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:59,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:59,800 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:59,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:26:59,804 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:26:59,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:26:59,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:26:59,808 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:26:59,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:26:59,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:26:59,854 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:379, output treesize:127 [2021-06-05 04:27:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:00,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357984343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:00,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:00,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:27:00,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081166315] [2021-06-05 04:27:00,001 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:00,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:00,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:00,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:00,002 INFO L87 Difference]: Start difference. First operand 426 states and 1396 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:00,417 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-06-05 04:27:00,721 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2021-06-05 04:27:00,998 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2021-06-05 04:27:01,230 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 04:27:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:01,337 INFO L93 Difference]: Finished difference Result 523 states and 1617 transitions. [2021-06-05 04:27:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:01,338 INFO L225 Difference]: With dead ends: 523 [2021-06-05 04:27:01,338 INFO L226 Difference]: Without dead ends: 509 [2021-06-05 04:27:01,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1509.1ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:27:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-06-05 04:27:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 423. [2021-06-05 04:27:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.286729857819905) internal successors, (1387), 422 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1387 transitions. [2021-06-05 04:27:01,343 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1387 transitions. Word has length 17 [2021-06-05 04:27:01,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:01,343 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1387 transitions. [2021-06-05 04:27:01,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1387 transitions. [2021-06-05 04:27:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:01,344 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:01,344 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:01,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2217,227 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:01,544 INFO L430 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash -324965886, now seen corresponding path program 81 times [2021-06-05 04:27:01,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:01,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465801448] [2021-06-05 04:27:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:01,856 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:01,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465801448] [2021-06-05 04:27:01,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465801448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:01,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322667160] [2021-06-05 04:27:01,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:01,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:27:01,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:01,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 04:27:01,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:01,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:01,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:02,004 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:02,008 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:02,012 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,066 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:02,068 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:182 [2021-06-05 04:27:02,169 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_641, v_prenex_643, v_prenex_645], 1=[v_prenex_646, array_4, v_prenex_642, v_prenex_644]} [2021-06-05 04:27:02,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:02,175 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:02,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,327 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2021-06-05 04:27:02,327 INFO L628 ElimStorePlain]: treesize reduction 180, result has 54.3 percent of original size [2021-06-05 04:27:02,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:02,331 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:02,395 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,511 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 04:27:02,512 INFO L628 ElimStorePlain]: treesize reduction 4, result has 98.0 percent of original size [2021-06-05 04:27:02,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:02,516 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,571 INFO L518 ElimStorePlain]: Eliminatee v_prenex_646 vanished before elimination [2021-06-05 04:27:02,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:02,577 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:02,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:27:02,580 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:02,639 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:02,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:02,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:02,695 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:02,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:02,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:02,747 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:411, output treesize:148 [2021-06-05 04:27:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:02,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322667160] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:02,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:02,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:27:02,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570899554] [2021-06-05 04:27:02,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:02,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:02,921 INFO L87 Difference]: Start difference. First operand 423 states and 1387 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:03,440 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 04:27:03,797 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2021-06-05 04:27:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:03,900 INFO L93 Difference]: Finished difference Result 491 states and 1563 transitions. [2021-06-05 04:27:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:03,901 INFO L225 Difference]: With dead ends: 491 [2021-06-05 04:27:03,902 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 04:27:03,902 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1252.8ms TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 04:27:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 425. [2021-06-05 04:27:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.285377358490566) internal successors, (1393), 424 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1393 transitions. [2021-06-05 04:27:03,906 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1393 transitions. Word has length 17 [2021-06-05 04:27:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:03,906 INFO L482 AbstractCegarLoop]: Abstraction has 425 states and 1393 transitions. [2021-06-05 04:27:03,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1393 transitions. [2021-06-05 04:27:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:03,907 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:03,907 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:04,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2230,228 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:04,108 INFO L430 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash 17617626, now seen corresponding path program 82 times [2021-06-05 04:27:04,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:04,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104338992] [2021-06-05 04:27:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:04,408 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:04,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104338992] [2021-06-05 04:27:04,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104338992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:04,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484676875] [2021-06-05 04:27:04,408 INFO L93 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 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:04,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:27:04,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:04,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:04,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:04,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:04,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:04,616 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:04,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:04,653 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:04,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:04,657 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:04,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:04,689 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:105 [2021-06-05 04:27:04,798 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_651, v_prenex_653, v_prenex_655], 1=[array_2, v_prenex_652, v_prenex_654, v_prenex_656]} [2021-06-05 04:27:04,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:04,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:27:04,808 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,893 INFO L628 ElimStorePlain]: treesize reduction 92, result has 59.3 percent of original size [2021-06-05 04:27:04,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:04,897 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:04,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:04,934 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:04,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:04,968 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:04,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:05,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:05,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:05,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:05,002 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:05,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:05,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:27:05,006 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:05,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:05,036 INFO L518 ElimStorePlain]: Eliminatee v_prenex_652 vanished before elimination [2021-06-05 04:27:05,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:05,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:05,040 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:05,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:05,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:05,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:27:05,073 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:05,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:05,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:05,103 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:247, output treesize:48 [2021-06-05 04:27:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:05,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484676875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:05,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:05,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:27:05,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108008425] [2021-06-05 04:27:05,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:27:05,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:27:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:27:05,160 INFO L87 Difference]: Start difference. First operand 425 states and 1393 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:05,847 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2021-06-05 04:27:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:06,033 INFO L93 Difference]: Finished difference Result 489 states and 1557 transitions. [2021-06-05 04:27:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:06,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:06,034 INFO L225 Difference]: With dead ends: 489 [2021-06-05 04:27:06,034 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 04:27:06,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 960.4ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 04:27:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2021-06-05 04:27:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 04:27:06,038 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 04:27:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:06,038 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 04:27:06,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 04:27:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:06,039 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:06,039 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:06,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2245 [2021-06-05 04:27:06,240 INFO L430 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash -574938828, now seen corresponding path program 83 times [2021-06-05 04:27:06,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:06,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997816109] [2021-06-05 04:27:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:06,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:06,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997816109] [2021-06-05 04:27:06,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997816109] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:06,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85900681] [2021-06-05 04:27:06,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:06,576 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:06,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:06,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:06,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:06,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:06,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:06,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:06,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:06,696 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:06,699 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:06,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:06,723 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:101 [2021-06-05 04:27:06,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:06,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:06,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:06,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:06,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:06,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,942 INFO L628 ElimStorePlain]: treesize reduction 119, result has 47.6 percent of original size [2021-06-05 04:27:06,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:06,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:06,946 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:06,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:06,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:06,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:06,979 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:07,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:07,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:07,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:07,003 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:07,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:07,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:07,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:07,027 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:07,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:07,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:07,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:07,049 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:07,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:07,068 INFO L518 ElimStorePlain]: Eliminatee v_prenex_664 vanished before elimination [2021-06-05 04:27:07,068 INFO L518 ElimStorePlain]: Eliminatee v_prenex_665 vanished before elimination [2021-06-05 04:27:07,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:07,069 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 04:27:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:07,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85900681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:07,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:07,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:27:07,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061465855] [2021-06-05 04:27:07,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:07,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:07,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:07,104 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:07,618 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-06-05 04:27:07,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:07,704 INFO L93 Difference]: Finished difference Result 491 states and 1567 transitions. [2021-06-05 04:27:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:07,705 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:07,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:07,705 INFO L225 Difference]: With dead ends: 491 [2021-06-05 04:27:07,705 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 04:27:07,706 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 774.2ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 04:27:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 423. [2021-06-05 04:27:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.2914691943127963) internal successors, (1389), 422 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1389 transitions. [2021-06-05 04:27:07,710 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1389 transitions. Word has length 17 [2021-06-05 04:27:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:07,710 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1389 transitions. [2021-06-05 04:27:07,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1389 transitions. [2021-06-05 04:27:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:07,711 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:07,711 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:07,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2270,230 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:07,911 INFO L430 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 906299042, now seen corresponding path program 84 times [2021-06-05 04:27:07,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:07,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191142365] [2021-06-05 04:27:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:08,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:08,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191142365] [2021-06-05 04:27:08,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191142365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:08,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397967660] [2021-06-05 04:27:08,072 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:08,098 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:27:08,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:08,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:08,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:08,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:08,206 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:08,217 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:08,254 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:08,257 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,288 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:08,288 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:102 [2021-06-05 04:27:08,399 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_671, v_prenex_673, v_prenex_675], 1=[array_4, v_prenex_672, v_prenex_674, v_prenex_676]} [2021-06-05 04:27:08,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:08,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,468 INFO L628 ElimStorePlain]: treesize reduction 112, result has 47.7 percent of original size [2021-06-05 04:27:08,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:08,472 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,494 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:27:08,497 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:08,521 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,541 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:08,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:08,546 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:08,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:08,569 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:08,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:08,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:08,591 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:08,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:08,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:08,611 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:221, output treesize:38 [2021-06-05 04:27:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:08,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397967660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:08,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:08,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:27:08,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267002957] [2021-06-05 04:27:08,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:27:08,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:08,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:27:08,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:27:08,649 INFO L87 Difference]: Start difference. First operand 423 states and 1389 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:09,207 INFO L93 Difference]: Finished difference Result 489 states and 1563 transitions. [2021-06-05 04:27:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:09,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:09,209 INFO L225 Difference]: With dead ends: 489 [2021-06-05 04:27:09,209 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 04:27:09,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 565.7ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 04:27:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 422. [2021-06-05 04:27:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 04:27:09,213 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 04:27:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:09,213 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 04:27:09,213 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 04:27:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:09,214 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:09,214 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:09,414 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2312 [2021-06-05 04:27:09,415 INFO L430 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1455215452, now seen corresponding path program 85 times [2021-06-05 04:27:09,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:09,415 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711292197] [2021-06-05 04:27:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:09,727 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 04:27:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:09,914 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:09,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711292197] [2021-06-05 04:27:09,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711292197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:09,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271071452] [2021-06-05 04:27:09,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:09,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:09,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:10,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:10,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:10,036 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:10,040 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:10,043 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,096 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:10,096 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 04:27:10,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:10,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:10,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,497 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2021-06-05 04:27:10,497 INFO L628 ElimStorePlain]: treesize reduction 157, result has 51.2 percent of original size [2021-06-05 04:27:10,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:10,501 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,543 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:10,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:10,548 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:10,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:10,593 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:27:10,637 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:10,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:27:10,685 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:10,689 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:10,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:10,726 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:10,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:10,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:27:10,730 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:10,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:10,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:27:10,763 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:340, output treesize:67 [2021-06-05 04:27:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:10,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271071452] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:10,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:10,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:27:10,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353354893] [2021-06-05 04:27:10,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:10,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:10,814 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:11,220 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2021-06-05 04:27:11,515 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2021-06-05 04:27:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:11,613 INFO L93 Difference]: Finished difference Result 488 states and 1561 transitions. [2021-06-05 04:27:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:11,614 INFO L225 Difference]: With dead ends: 488 [2021-06-05 04:27:11,614 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 04:27:11,614 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1223.6ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 04:27:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 424. [2021-06-05 04:27:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.2884160756501184) internal successors, (1391), 423 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1391 transitions. [2021-06-05 04:27:11,618 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1391 transitions. Word has length 17 [2021-06-05 04:27:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:11,618 INFO L482 AbstractCegarLoop]: Abstraction has 424 states and 1391 transitions. [2021-06-05 04:27:11,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1391 transitions. [2021-06-05 04:27:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:11,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:11,619 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:11,819 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 232 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2342 [2021-06-05 04:27:11,820 INFO L430 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:11,820 INFO L82 PathProgramCache]: Analyzing trace with hash 640409298, now seen corresponding path program 86 times [2021-06-05 04:27:11,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:11,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321570709] [2021-06-05 04:27:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:12,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:12,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321570709] [2021-06-05 04:27:12,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321570709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:12,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231383144] [2021-06-05 04:27:12,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:12,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:12,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:12,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:12,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:12,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:12,390 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:12,393 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:12,432 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:12,435 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:12,467 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:105 [2021-06-05 04:27:12,575 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_690, v_prenex_692, v_prenex_694], 1=[array_2, v_prenex_691, v_prenex_693, v_prenex_695]} [2021-06-05 04:27:12,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:12,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:27:12,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,652 INFO L628 ElimStorePlain]: treesize reduction 116, result has 44.2 percent of original size [2021-06-05 04:27:12,653 INFO L518 ElimStorePlain]: Eliminatee v_prenex_690 vanished before elimination [2021-06-05 04:27:12,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:12,656 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:12,681 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:12,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:12,706 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:12,726 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,726 INFO L518 ElimStorePlain]: Eliminatee v_prenex_691 vanished before elimination [2021-06-05 04:27:12,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:27:12,731 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:12,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:12,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:12,754 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:12,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:12,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:12,775 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:227, output treesize:38 [2021-06-05 04:27:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:12,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231383144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:12,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:12,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:27:12,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743870342] [2021-06-05 04:27:12,814 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:12,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:12,814 INFO L87 Difference]: Start difference. First operand 424 states and 1391 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:13,285 INFO L93 Difference]: Finished difference Result 485 states and 1553 transitions. [2021-06-05 04:27:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:13,291 INFO L225 Difference]: With dead ends: 485 [2021-06-05 04:27:13,291 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 04:27:13,291 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 753.1ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:27:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 04:27:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 422. [2021-06-05 04:27:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 04:27:13,295 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 04:27:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:13,295 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 04:27:13,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 04:27:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:13,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:13,296 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:13,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2387 [2021-06-05 04:27:13,497 INFO L430 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1662308434, now seen corresponding path program 87 times [2021-06-05 04:27:13,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:13,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995672415] [2021-06-05 04:27:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:13,768 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:13,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995672415] [2021-06-05 04:27:13,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995672415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:13,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83744196] [2021-06-05 04:27:13,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:13,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:27:13,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 04:27:13,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:13,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:13,896 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:13,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:13,901 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:13,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:13,905 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:13,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:13,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:13,909 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:13,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:13,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:13,979 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:245, output treesize:214 [2021-06-05 04:27:14,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:14,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:14,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:14,129 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:14,135 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:14,142 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:14,148 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:14,155 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:14,161 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,373 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2021-06-05 04:27:14,373 INFO L628 ElimStorePlain]: treesize reduction 185, result has 58.8 percent of original size [2021-06-05 04:27:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:14,378 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:14,382 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:14,387 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:14,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:27:14,391 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:14,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:14,482 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:14,482 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:515, output treesize:210 [2021-06-05 04:27:14,750 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-06-05 04:27:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:14,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83744196] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:14,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:14,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 04:27:14,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202497005] [2021-06-05 04:27:14,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:14,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:14,858 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:15,206 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2021-06-05 04:27:15,446 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2021-06-05 04:27:15,768 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-06-05 04:27:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:15,961 INFO L93 Difference]: Finished difference Result 504 states and 1582 transitions. [2021-06-05 04:27:15,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:27:15,961 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:15,962 INFO L225 Difference]: With dead ends: 504 [2021-06-05 04:27:15,962 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 04:27:15,962 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1511.9ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:27:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 04:27:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 422. [2021-06-05 04:27:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.2921615201900236) internal successors, (1386), 421 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1386 transitions. [2021-06-05 04:27:15,967 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1386 transitions. Word has length 17 [2021-06-05 04:27:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:15,967 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1386 transitions. [2021-06-05 04:27:15,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1386 transitions. [2021-06-05 04:27:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:15,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:15,968 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:16,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417,234 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:16,168 INFO L430 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2004891946, now seen corresponding path program 88 times [2021-06-05 04:27:16,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:16,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325338337] [2021-06-05 04:27:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:16,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:16,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325338337] [2021-06-05 04:27:16,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325338337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:16,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460406728] [2021-06-05 04:27:16,386 INFO L93 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 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:16,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:27:16,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:16,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:16,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:16,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:16,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:16,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:16,563 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:16,566 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:16,598 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 04:27:16,708 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_702, v_prenex_704, array_0, v_prenex_700], 1=[v_prenex_701, v_prenex_703, v_prenex_705, array_2]} [2021-06-05 04:27:16,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:27:16,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:16,718 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,799 INFO L628 ElimStorePlain]: treesize reduction 96, result has 58.4 percent of original size [2021-06-05 04:27:16,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:16,803 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:16,839 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,870 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:16,874 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:16,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,909 INFO L518 ElimStorePlain]: Eliminatee v_prenex_701 vanished before elimination [2021-06-05 04:27:16,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:27:16,914 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:16,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:27:16,918 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:16,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:27:16,950 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:16,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:16,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:16,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:16,982 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:17,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:17,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:17,010 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 04:27:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:17,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460406728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:17,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:17,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:27:17,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974185336] [2021-06-05 04:27:17,064 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:27:17,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:27:17,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:27:17,065 INFO L87 Difference]: Start difference. First operand 422 states and 1386 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:17,578 INFO L93 Difference]: Finished difference Result 484 states and 1551 transitions. [2021-06-05 04:27:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:17,580 INFO L225 Difference]: With dead ends: 484 [2021-06-05 04:27:17,580 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 04:27:17,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 626.2ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 04:27:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 421. [2021-06-05 04:27:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.295238095238095) internal successors, (1384), 420 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1384 transitions. [2021-06-05 04:27:17,584 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1384 transitions. Word has length 17 [2021-06-05 04:27:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:17,584 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1384 transitions. [2021-06-05 04:27:17,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1384 transitions. [2021-06-05 04:27:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:17,585 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:17,585 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:17,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 235 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2438 [2021-06-05 04:27:17,785 INFO L430 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 569417172, now seen corresponding path program 89 times [2021-06-05 04:27:17,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:17,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813286611] [2021-06-05 04:27:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:18,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:18,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813286611] [2021-06-05 04:27:18,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813286611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:18,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760237005] [2021-06-05 04:27:18,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:18,168 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:27:18,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:18,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:18,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:18,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:18,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:18,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:18,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:18,292 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:18,294 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:18,313 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:18,313 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:84 [2021-06-05 04:27:18,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:18,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,408 INFO L628 ElimStorePlain]: treesize reduction 31, result has 69.3 percent of original size [2021-06-05 04:27:18,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:18,411 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:18,432 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:18,432 INFO L518 ElimStorePlain]: Eliminatee v_prenex_708 vanished before elimination [2021-06-05 04:27:18,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:18,434 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:18,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:18,445 INFO L518 ElimStorePlain]: Eliminatee v_prenex_710 vanished before elimination [2021-06-05 04:27:18,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:18,446 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:120, output treesize:32 [2021-06-05 04:27:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:18,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760237005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:18,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:18,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 04:27:18,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199856220] [2021-06-05 04:27:18,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:18,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:18,480 INFO L87 Difference]: Start difference. First operand 421 states and 1384 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:18,984 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-06-05 04:27:19,154 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2021-06-05 04:27:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:19,227 INFO L93 Difference]: Finished difference Result 506 states and 1606 transitions. [2021-06-05 04:27:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:19,228 INFO L225 Difference]: With dead ends: 506 [2021-06-05 04:27:19,228 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 04:27:19,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 931.9ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:27:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 04:27:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 421. [2021-06-05 04:27:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.288095238095238) internal successors, (1381), 420 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1381 transitions. [2021-06-05 04:27:19,233 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1381 transitions. Word has length 17 [2021-06-05 04:27:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:19,233 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1381 transitions. [2021-06-05 04:27:19,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1381 transitions. [2021-06-05 04:27:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:19,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:19,234 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:19,434 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 236 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2463 [2021-06-05 04:27:19,434 INFO L430 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -245388982, now seen corresponding path program 90 times [2021-06-05 04:27:19,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:19,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506205776] [2021-06-05 04:27:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:19,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:19,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506205776] [2021-06-05 04:27:19,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506205776] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:19,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736958674] [2021-06-05 04:27:19,706 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:19,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:27:19,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:19,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:19,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:19,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:19,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:19,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:19,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:19,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:19,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:19,893 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:19,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:19,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:19,897 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:19,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:19,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:19,929 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 04:27:20,033 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_715, v_prenex_717, v_prenex_719], 1=[v_prenex_716, array_2, v_prenex_718, v_prenex_720]} [2021-06-05 04:27:20,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:20,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:20,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 04:27:20,043 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:20,105 INFO L628 ElimStorePlain]: treesize reduction 112, result has 47.7 percent of original size [2021-06-05 04:27:20,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:20,109 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:20,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:20,130 INFO L518 ElimStorePlain]: Eliminatee v_prenex_717 vanished before elimination [2021-06-05 04:27:20,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:20,133 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:20,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:20,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:20,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:20,157 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:20,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:20,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:20,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:20,180 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:20,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:20,199 INFO L518 ElimStorePlain]: Eliminatee v_prenex_718 vanished before elimination [2021-06-05 04:27:20,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:20,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:20,202 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:20,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:20,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:20,223 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 04:27:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:20,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736958674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:20,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:20,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 04:27:20,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641045817] [2021-06-05 04:27:20,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:20,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:20,262 INFO L87 Difference]: Start difference. First operand 421 states and 1381 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:20,878 INFO L93 Difference]: Finished difference Result 500 states and 1587 transitions. [2021-06-05 04:27:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:20,879 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:20,879 INFO L225 Difference]: With dead ends: 500 [2021-06-05 04:27:20,880 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 04:27:20,880 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 743.0ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:27:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 04:27:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 415. [2021-06-05 04:27:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 04:27:20,884 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 04:27:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:20,884 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 04:27:20,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 04:27:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:20,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:20,885 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:21,085 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2472,237 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:21,085 INFO L430 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:21,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:21,086 INFO L82 PathProgramCache]: Analyzing trace with hash 344982116, now seen corresponding path program 91 times [2021-06-05 04:27:21,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:21,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357644814] [2021-06-05 04:27:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:21,306 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:21,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357644814] [2021-06-05 04:27:21,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357644814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:21,306 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406066517] [2021-06-05 04:27:21,306 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:21,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:21,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:21,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:21,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:21,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:21,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:21,467 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:21,470 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:21,503 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:21,503 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:118 [2021-06-05 04:27:21,675 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 04:27:21,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:21,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:21,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:27:21,690 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:21,695 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:21,700 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:21,705 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:21,710 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:21,715 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,850 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 04:27:21,850 INFO L628 ElimStorePlain]: treesize reduction 130, result has 57.9 percent of original size [2021-06-05 04:27:21,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:27:21,855 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:21,861 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:21,865 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:21,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:21,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:21,869 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:21,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:21,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:21,924 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:387, output treesize:101 [2021-06-05 04:27:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:22,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406066517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:22,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:22,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:27:22,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641383794] [2021-06-05 04:27:22,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:22,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:22,048 INFO L87 Difference]: Start difference. First operand 415 states and 1357 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:22,672 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2021-06-05 04:27:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:22,854 INFO L93 Difference]: Finished difference Result 553 states and 1747 transitions. [2021-06-05 04:27:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:22,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:22,855 INFO L225 Difference]: With dead ends: 553 [2021-06-05 04:27:22,855 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 04:27:22,856 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 906.0ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:27:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 04:27:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 413. [2021-06-05 04:27:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 04:27:22,860 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 04:27:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:22,861 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 04:27:22,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 04:27:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:22,861 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:22,861 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:23,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2502,238 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:23,062 INFO L430 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash -109288126, now seen corresponding path program 92 times [2021-06-05 04:27:23,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:23,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833163496] [2021-06-05 04:27:23,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:23,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:23,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833163496] [2021-06-05 04:27:23,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833163496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:23,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065895570] [2021-06-05 04:27:23,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:23,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:23,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:23,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:23,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:23,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:23,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:23,513 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:23,517 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:23,520 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,568 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:23,569 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:23,569 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:162 [2021-06-05 04:27:23,662 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_725, array_0, v_prenex_727, v_prenex_729], 1=[v_prenex_726, v_prenex_728, array_4, v_prenex_730]} [2021-06-05 04:27:23,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:23,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:23,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,804 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2021-06-05 04:27:23,804 INFO L628 ElimStorePlain]: treesize reduction 163, result has 54.1 percent of original size [2021-06-05 04:27:23,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:23,809 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:23,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:23,864 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:23,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:23,919 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:23,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:23,973 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:23,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:23,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:27:23,977 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:24,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:24,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:24,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:24,029 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:24,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:24,076 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:24,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:24,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:24,079 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:24,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:24,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:24,126 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:371, output treesize:125 [2021-06-05 04:27:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:24,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065895570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:24,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:24,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 04:27:24,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384246479] [2021-06-05 04:27:24,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:24,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:24,276 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:24,767 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-05 04:27:25,140 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2021-06-05 04:27:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:25,237 INFO L93 Difference]: Finished difference Result 502 states and 1603 transitions. [2021-06-05 04:27:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:25,238 INFO L225 Difference]: With dead ends: 502 [2021-06-05 04:27:25,238 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 04:27:25,238 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1216.9ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 04:27:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 417. [2021-06-05 04:27:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 04:27:25,243 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 04:27:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:25,243 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 04:27:25,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 04:27:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:25,244 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:25,244 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:25,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 239 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2530 [2021-06-05 04:27:25,444 INFO L430 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash 233295386, now seen corresponding path program 93 times [2021-06-05 04:27:25,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:25,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014019057] [2021-06-05 04:27:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:25,687 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:25,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014019057] [2021-06-05 04:27:25,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014019057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:25,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604474805] [2021-06-05 04:27:25,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:25,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 04:27:25,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:25,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:25,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:25,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:25,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:25,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:25,846 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:25,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:25,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:25,882 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:25,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:25,886 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:25,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:25,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:25,916 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 04:27:26,025 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_735, v_prenex_737, array_0, v_prenex_739], 1=[v_prenex_736, v_prenex_738, array_2, v_prenex_740]} [2021-06-05 04:27:26,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:26,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:26,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,120 INFO L628 ElimStorePlain]: treesize reduction 89, result has 60.3 percent of original size [2021-06-05 04:27:26,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:27:26,124 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:26,128 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:26,163 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:26,196 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:26,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:26,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:26,228 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:26,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:26,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:26,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:26,261 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:26,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:26,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:27:26,265 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:26,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:26,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:26,297 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:26,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:26,324 INFO L518 ElimStorePlain]: Eliminatee v_prenex_740 vanished before elimination [2021-06-05 04:27:26,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:26,326 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 04:27:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:26,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604474805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:26,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:26,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:27:26,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915046135] [2021-06-05 04:27:26,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:27:26,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:27:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:27:26,381 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:27,021 INFO L93 Difference]: Finished difference Result 500 states and 1597 transitions. [2021-06-05 04:27:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:27,022 INFO L225 Difference]: With dead ends: 500 [2021-06-05 04:27:27,022 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 04:27:27,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 726.6ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 04:27:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 415. [2021-06-05 04:27:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 04:27:27,027 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 04:27:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:27,027 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 04:27:27,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 04:27:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:27,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:27,028 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:27,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2545 [2021-06-05 04:27:27,228 INFO L430 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:27,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1873488734, now seen corresponding path program 94 times [2021-06-05 04:27:27,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:27,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524562633] [2021-06-05 04:27:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:27,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:27,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524562633] [2021-06-05 04:27:27,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524562633] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:27,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984413083] [2021-06-05 04:27:27,415 INFO L93 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 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:27,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:27:27,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:27,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:27,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:27,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:27,521 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:27,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:27,555 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:27,558 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:27,584 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:95 [2021-06-05 04:27:27,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:27,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,808 INFO L628 ElimStorePlain]: treesize reduction 109, result has 48.6 percent of original size [2021-06-05 04:27:27,808 INFO L518 ElimStorePlain]: Eliminatee v_prenex_746 vanished before elimination [2021-06-05 04:27:27,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:27,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:27,838 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:27,864 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:27,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:27,889 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:27:27,913 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:27,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:27,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:27,935 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:27,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:27,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:27,955 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 04:27:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:27,993 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984413083] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:27,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:27,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 04:27:27,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196535819] [2021-06-05 04:27:27,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:27:27,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:27:27,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:27:27,994 INFO L87 Difference]: Start difference. First operand 415 states and 1357 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:28,485 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2021-06-05 04:27:28,645 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2021-06-05 04:27:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:28,829 INFO L93 Difference]: Finished difference Result 547 states and 1730 transitions. [2021-06-05 04:27:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:28,830 INFO L225 Difference]: With dead ends: 547 [2021-06-05 04:27:28,830 INFO L226 Difference]: Without dead ends: 533 [2021-06-05 04:27:28,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 830.9ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:27:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-06-05 04:27:28,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 413. [2021-06-05 04:27:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 04:27:28,835 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 04:27:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:28,835 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 04:27:28,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 04:27:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:28,836 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:28,836 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:29,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2570,241 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:29,036 INFO L430 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash -684833076, now seen corresponding path program 95 times [2021-06-05 04:27:29,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:29,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69575591] [2021-06-05 04:27:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:29,437 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:29,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69575591] [2021-06-05 04:27:29,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69575591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:29,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557034262] [2021-06-05 04:27:29,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:29,464 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:27:29,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:29,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:29,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:29,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:29,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:29,604 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:29,643 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:29,647 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:29,680 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:29,680 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:119 [2021-06-05 04:27:29,906 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 04:27:29,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:29,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:29,916 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:29,920 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:29,925 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:29,930 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:29,934 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:29,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:29,939 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:29,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:29,943 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:30,075 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2021-06-05 04:27:30,075 INFO L628 ElimStorePlain]: treesize reduction 138, result has 57.9 percent of original size [2021-06-05 04:27:30,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:30,080 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:30,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:30,084 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:30,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:30,089 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:30,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:30,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:27:30,093 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:30,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:30,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:30,148 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:389, output treesize:103 [2021-06-05 04:27:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:30,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557034262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:30,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:30,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:27:30,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184687802] [2021-06-05 04:27:30,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:30,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:30,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:30,270 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:30,679 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 101 [2021-06-05 04:27:30,929 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 109 [2021-06-05 04:27:31,159 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 107 [2021-06-05 04:27:31,464 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2021-06-05 04:27:31,797 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 126 [2021-06-05 04:27:32,168 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2021-06-05 04:27:32,624 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 133 [2021-06-05 04:27:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:32,830 INFO L93 Difference]: Finished difference Result 640 states and 2012 transitions. [2021-06-05 04:27:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:27:32,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:32,832 INFO L225 Difference]: With dead ends: 640 [2021-06-05 04:27:32,832 INFO L226 Difference]: Without dead ends: 619 [2021-06-05 04:27:32,832 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2673.1ms TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:27:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-06-05 04:27:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 417. [2021-06-05 04:27:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 04:27:32,837 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 04:27:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:32,837 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 04:27:32,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 04:27:32,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:32,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:32,838 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:33,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2601,242 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:33,038 INFO L430 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:33,039 INFO L82 PathProgramCache]: Analyzing trace with hash 590115602, now seen corresponding path program 96 times [2021-06-05 04:27:33,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:33,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256344177] [2021-06-05 04:27:33,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:33,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:33,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256344177] [2021-06-05 04:27:33,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256344177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:33,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842440303] [2021-06-05 04:27:33,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:33,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:27:33,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:33,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:33,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:33,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:33,715 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:33,719 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:33,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:33,771 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:33,775 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:33,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:33,821 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:145 [2021-06-05 04:27:33,958 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 04:27:33,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:33,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:33,967 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:33,972 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:33,977 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:33,982 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:33,986 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:33,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:33,991 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:33,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:33,995 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:34,124 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2021-06-05 04:27:34,124 INFO L628 ElimStorePlain]: treesize reduction 130, result has 57.0 percent of original size [2021-06-05 04:27:34,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:34,129 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:34,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:27:34,134 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:34,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:34,139 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:34,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:34,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:34,144 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:34,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:34,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:34,197 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:377, output treesize:103 [2021-06-05 04:27:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:34,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842440303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:34,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:34,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:27:34,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406278109] [2021-06-05 04:27:34,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:34,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:34,317 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:34,808 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2021-06-05 04:27:35,035 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2021-06-05 04:27:35,176 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-06-05 04:27:35,347 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2021-06-05 04:27:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:35,646 INFO L93 Difference]: Finished difference Result 594 states and 1871 transitions. [2021-06-05 04:27:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:35,646 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:35,647 INFO L225 Difference]: With dead ends: 594 [2021-06-05 04:27:35,647 INFO L226 Difference]: Without dead ends: 570 [2021-06-05 04:27:35,647 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1586.3ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:27:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-06-05 04:27:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 421. [2021-06-05 04:27:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 04:27:35,653 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 04:27:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:35,653 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 04:27:35,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 04:27:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:35,653 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:35,653 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:35,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2624 [2021-06-05 04:27:35,854 INFO L430 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:35,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash 932699114, now seen corresponding path program 97 times [2021-06-05 04:27:35,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:35,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762404823] [2021-06-05 04:27:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:36,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:36,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762404823] [2021-06-05 04:27:36,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762404823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:36,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390547938] [2021-06-05 04:27:36,103 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:36,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:36,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:36,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:36,268 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:36,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:36,310 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:36,314 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:27:36,345 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:99 [2021-06-05 04:27:36,450 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_767, array_0, v_prenex_763, v_prenex_765], 1=[v_prenex_768, array_2, v_prenex_764, v_prenex_766]} [2021-06-05 04:27:36,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:36,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:36,459 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,547 INFO L628 ElimStorePlain]: treesize reduction 85, result has 61.4 percent of original size [2021-06-05 04:27:36,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:36,551 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 04:27:36,555 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:36,591 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:36,624 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:36,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:36,658 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:36,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:36,690 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:36,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 04:27:36,694 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:36,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:36,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:36,727 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:36,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:36,754 INFO L518 ElimStorePlain]: Eliminatee v_prenex_766 vanished before elimination [2021-06-05 04:27:36,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:36,756 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:235, output treesize:48 [2021-06-05 04:27:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:36,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390547938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:36,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:36,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 04:27:36,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466579018] [2021-06-05 04:27:36,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:27:36,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:36,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:27:36,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:27:36,813 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:37,173 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 04:27:37,420 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2021-06-05 04:27:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:37,727 INFO L93 Difference]: Finished difference Result 576 states and 1834 transitions. [2021-06-05 04:27:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:27:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:37,728 INFO L225 Difference]: With dead ends: 576 [2021-06-05 04:27:37,728 INFO L226 Difference]: Without dead ends: 565 [2021-06-05 04:27:37,728 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 966.1ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:27:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-06-05 04:27:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 421. [2021-06-05 04:27:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 04:27:37,733 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 04:27:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:37,733 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 04:27:37,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 04:27:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:37,734 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:37,734 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:37,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2647,244 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:37,953 INFO L430 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:37,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2073250540, now seen corresponding path program 98 times [2021-06-05 04:27:37,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:37,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843322444] [2021-06-05 04:27:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:38,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:38,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843322444] [2021-06-05 04:27:38,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843322444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:38,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610010942] [2021-06-05 04:27:38,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:38,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:38,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:38,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:27:38,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:38,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:38,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:38,507 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:38,511 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:38,515 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:38,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:38,564 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:162 [2021-06-05 04:27:38,665 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_769, array_0, v_prenex_771, v_prenex_773], 1=[array_4, v_prenex_770, v_prenex_772, v_prenex_774]} [2021-06-05 04:27:38,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:38,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:38,674 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,810 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-06-05 04:27:38,810 INFO L628 ElimStorePlain]: treesize reduction 152, result has 57.7 percent of original size [2021-06-05 04:27:38,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:38,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,870 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:38,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:38,874 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:38,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 04:27:38,932 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 04:27:38,936 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:38,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:38,987 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:38,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:38,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:38,991 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:39,039 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:39,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:39,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:39,044 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:39,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:39,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:39,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:39,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 04:27:39,095 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:39,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:39,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:27:39,099 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:39,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:39,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:39,145 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:371, output treesize:127 [2021-06-05 04:27:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:39,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610010942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:39,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:39,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:27:39,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684874573] [2021-06-05 04:27:39,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:39,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:39,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:39,293 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:39,879 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2021-06-05 04:27:40,124 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2021-06-05 04:27:40,259 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2021-06-05 04:27:40,427 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-06-05 04:27:40,800 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2021-06-05 04:27:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:40,886 INFO L93 Difference]: Finished difference Result 625 states and 1960 transitions. [2021-06-05 04:27:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:27:40,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:40,887 INFO L225 Difference]: With dead ends: 625 [2021-06-05 04:27:40,887 INFO L226 Difference]: Without dead ends: 593 [2021-06-05 04:27:40,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1853.6ms TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:27:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-06-05 04:27:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 428. [2021-06-05 04:27:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.2740046838407495) internal successors, (1398), 427 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1398 transitions. [2021-06-05 04:27:40,893 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1398 transitions. Word has length 17 [2021-06-05 04:27:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:40,893 INFO L482 AbstractCegarLoop]: Abstraction has 428 states and 1398 transitions. [2021-06-05 04:27:40,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1398 transitions. [2021-06-05 04:27:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:40,894 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:40,894 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:41,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2672 [2021-06-05 04:27:41,116 INFO L430 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1879133244, now seen corresponding path program 99 times [2021-06-05 04:27:41,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:41,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424889731] [2021-06-05 04:27:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:41,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:41,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424889731] [2021-06-05 04:27:41,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424889731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:41,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249740411] [2021-06-05 04:27:41,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:41,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 04:27:41,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:41,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 04:27:41,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:41,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:41,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:41,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:41,560 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:41,564 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:41,628 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:41,628 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:233, output treesize:199 [2021-06-05 04:27:41,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:41,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:41,750 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:41,755 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:41,760 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 04:27:41,764 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:41,769 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:41,774 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:41,778 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,957 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-06-05 04:27:41,957 INFO L628 ElimStorePlain]: treesize reduction 172, result has 59.1 percent of original size [2021-06-05 04:27:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 04:27:41,962 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:41,966 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 04:27:41,970 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:41,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:41,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:41,974 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:42,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:42,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:27:42,050 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:485, output treesize:195 [2021-06-05 04:27:42,294 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-06-05 04:27:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:42,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249740411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:42,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:42,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 04:27:42,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263561019] [2021-06-05 04:27:42,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:27:42,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:27:42,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:27:42,405 INFO L87 Difference]: Start difference. First operand 428 states and 1398 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:42,704 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2021-06-05 04:27:42,892 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-06-05 04:27:43,150 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2021-06-05 04:27:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:43,393 INFO L93 Difference]: Finished difference Result 604 states and 1916 transitions. [2021-06-05 04:27:43,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:43,394 INFO L225 Difference]: With dead ends: 604 [2021-06-05 04:27:43,394 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 04:27:43,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1437.0ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 04:27:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 429. [2021-06-05 04:27:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 04:27:43,400 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 04:27:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:43,400 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 04:27:43,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 04:27:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 04:27:43,400 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:43,400 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:43,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2687,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:43,601 INFO L430 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:43,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash 309049932, now seen corresponding path program 100 times [2021-06-05 04:27:43,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:43,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813941995] [2021-06-05 04:27:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:43,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:43,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813941995] [2021-06-05 04:27:43,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813941995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:43,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590102206] [2021-06-05 04:27:43,852 INFO L93 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 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:43,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:27:43,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:43,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:43,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:43,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:43,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:43,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:43,947 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:43,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:43,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:43,967 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:43,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:43,970 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:43,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:43,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:43,985 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:70 [2021-06-05 04:27:44,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:44,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:44,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:44,072 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:44,104 INFO L628 ElimStorePlain]: treesize reduction 45, result has 63.4 percent of original size [2021-06-05 04:27:44,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:44,108 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:44,121 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:44,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:27:44,124 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:44,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:44,137 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:27:44,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:44,139 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:44,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:44,149 INFO L518 ElimStorePlain]: Eliminatee v_prenex_777 vanished before elimination [2021-06-05 04:27:44,150 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:27:44,150 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 04:27:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:44,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590102206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:44,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:44,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 04:27:44,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27796504] [2021-06-05 04:27:44,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:27:44,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:27:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:27:44,190 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:44,678 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 67 [2021-06-05 04:27:44,856 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 73 [2021-06-05 04:27:45,036 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2021-06-05 04:27:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:45,082 INFO L93 Difference]: Finished difference Result 637 states and 2020 transitions. [2021-06-05 04:27:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 04:27:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-06-05 04:27:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:45,083 INFO L225 Difference]: With dead ends: 637 [2021-06-05 04:27:45,083 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 04:27:45,083 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 957.6ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:27:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 04:27:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 429. [2021-06-05 04:27:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 04:27:45,089 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 04:27:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:45,089 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 04:27:45,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 04:27:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:45,089 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:45,089 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:45,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2705,247 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:45,290 INFO L430 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1605107838, now seen corresponding path program 101 times [2021-06-05 04:27:45,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:45,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031418129] [2021-06-05 04:27:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:45,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:45,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031418129] [2021-06-05 04:27:45,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031418129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:45,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131920883] [2021-06-05 04:27:45,590 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:45,617 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:45,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:45,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:27:45,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:45,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:45,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:45,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:45,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:45,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:45,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:45,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:45,717 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 04:27:45,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:45,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:45,836 INFO L628 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2021-06-05 04:27:45,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:45,838 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:45,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:45,844 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:45,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:45,846 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:45,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:45,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:45,852 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:16 [2021-06-05 04:27:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:45,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131920883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:45,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:45,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:27:45,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528710192] [2021-06-05 04:27:45,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:27:45,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:27:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:27:45,880 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:46,621 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2021-06-05 04:27:46,821 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2021-06-05 04:27:47,005 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2021-06-05 04:27:47,281 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-06-05 04:27:47,413 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2021-06-05 04:27:47,577 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2021-06-05 04:27:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:47,763 INFO L93 Difference]: Finished difference Result 577 states and 1815 transitions. [2021-06-05 04:27:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:27:47,764 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:47,765 INFO L225 Difference]: With dead ends: 577 [2021-06-05 04:27:47,765 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 04:27:47,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1827.6ms TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 04:27:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 04:27:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 434. [2021-06-05 04:27:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.284064665127021) internal successors, (1422), 433 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1422 transitions. [2021-06-05 04:27:47,770 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1422 transitions. Word has length 18 [2021-06-05 04:27:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:47,770 INFO L482 AbstractCegarLoop]: Abstraction has 434 states and 1422 transitions. [2021-06-05 04:27:47,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1422 transitions. [2021-06-05 04:27:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:47,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:47,771 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:47,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2714,248 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:47,971 INFO L430 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -343958516, now seen corresponding path program 102 times [2021-06-05 04:27:47,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:47,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816536430] [2021-06-05 04:27:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:48,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:48,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816536430] [2021-06-05 04:27:48,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816536430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:48,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122003595] [2021-06-05 04:27:48,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:48,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:27:48,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:48,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:48,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:48,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:48,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:48,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:48,300 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:48,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:48,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:48,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:27:48,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:48,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:48,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:48,418 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:48,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:48,418 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:27:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:48,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122003595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:48,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:48,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:48,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60330290] [2021-06-05 04:27:48,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:48,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:48,444 INFO L87 Difference]: Start difference. First operand 434 states and 1422 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:48,894 INFO L93 Difference]: Finished difference Result 506 states and 1618 transitions. [2021-06-05 04:27:48,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:48,895 INFO L225 Difference]: With dead ends: 506 [2021-06-05 04:27:48,895 INFO L226 Difference]: Without dead ends: 501 [2021-06-05 04:27:48,896 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 515.3ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:27:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-06-05 04:27:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 440. [2021-06-05 04:27:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.287015945330296) internal successors, (1443), 439 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1443 transitions. [2021-06-05 04:27:48,900 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1443 transitions. Word has length 18 [2021-06-05 04:27:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:48,901 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1443 transitions. [2021-06-05 04:27:48,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1443 transitions. [2021-06-05 04:27:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:48,901 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:48,901 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:49,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 249 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2723 [2021-06-05 04:27:49,102 INFO L430 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:49,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2011020034, now seen corresponding path program 103 times [2021-06-05 04:27:49,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:49,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855974507] [2021-06-05 04:27:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:49,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:49,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855974507] [2021-06-05 04:27:49,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855974507] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:49,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652038335] [2021-06-05 04:27:49,352 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:49,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:27:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:49,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:49,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:49,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:49,493 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:49,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:49,517 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 04:27:49,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:49,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:49,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:49,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:49,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:49,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:49,583 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:49,586 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:49,640 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 04:27:49,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:49,644 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:49,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:49,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:49,667 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:27:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:49,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652038335] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:49,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:49,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:27:49,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290466233] [2021-06-05 04:27:49,769 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:27:49,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:27:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:49,770 INFO L87 Difference]: Start difference. First operand 440 states and 1443 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:50,278 INFO L93 Difference]: Finished difference Result 516 states and 1643 transitions. [2021-06-05 04:27:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:50,278 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:50,279 INFO L225 Difference]: With dead ends: 516 [2021-06-05 04:27:50,279 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 04:27:50,279 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 646.3ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:27:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 04:27:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 443. [2021-06-05 04:27:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.2850678733031673) internal successors, (1452), 442 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1452 transitions. [2021-06-05 04:27:50,284 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1452 transitions. Word has length 18 [2021-06-05 04:27:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:50,284 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1452 transitions. [2021-06-05 04:27:50,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1452 transitions. [2021-06-05 04:27:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:50,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:50,285 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:50,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2733 [2021-06-05 04:27:50,485 INFO L430 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1137279354, now seen corresponding path program 104 times [2021-06-05 04:27:50,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:50,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236103779] [2021-06-05 04:27:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:50,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:50,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236103779] [2021-06-05 04:27:50,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236103779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:50,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57444316] [2021-06-05 04:27:50,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:50,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:50,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:50,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:50,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:50,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:50,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:50,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:50,822 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:50,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:50,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:27:50,890 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_782], 1=[array_4, v_prenex_783]} [2021-06-05 04:27:50,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:50,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:50,896 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,936 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 04:27:50,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:50,938 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:50,952 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:27:50,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:27:50,955 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:50,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:50,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:50,968 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:27:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:51,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57444316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:51,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:51,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:51,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66123833] [2021-06-05 04:27:51,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:51,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:51,029 INFO L87 Difference]: Start difference. First operand 443 states and 1452 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:51,839 INFO L93 Difference]: Finished difference Result 525 states and 1675 transitions. [2021-06-05 04:27:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:27:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:51,840 INFO L225 Difference]: With dead ends: 525 [2021-06-05 04:27:51,840 INFO L226 Difference]: Without dead ends: 515 [2021-06-05 04:27:51,840 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 786.7ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:27:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-06-05 04:27:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 445. [2021-06-05 04:27:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.2882882882882885) internal successors, (1460), 444 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1460 transitions. [2021-06-05 04:27:51,845 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1460 transitions. Word has length 18 [2021-06-05 04:27:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:51,845 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1460 transitions. [2021-06-05 04:27:51,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1460 transitions. [2021-06-05 04:27:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:51,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:51,846 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:52,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 251 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2743 [2021-06-05 04:27:52,046 INFO L430 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash 193897062, now seen corresponding path program 105 times [2021-06-05 04:27:52,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:52,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242055084] [2021-06-05 04:27:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:52,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:52,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242055084] [2021-06-05 04:27:52,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242055084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:52,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395443639] [2021-06-05 04:27:52,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:52,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:27:52,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:52,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:52,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:52,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:52,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:52,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:52,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:52,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:52,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:52,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:52,389 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:27:52,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:52,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:52,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:52,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:52,481 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:27:52,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:52,483 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:52,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:52,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:52,490 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:27:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:52,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395443639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:52,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:52,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:52,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742897556] [2021-06-05 04:27:52,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:52,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:52,514 INFO L87 Difference]: Start difference. First operand 445 states and 1460 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:52,957 INFO L93 Difference]: Finished difference Result 529 states and 1688 transitions. [2021-06-05 04:27:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:52,958 INFO L225 Difference]: With dead ends: 529 [2021-06-05 04:27:52,958 INFO L226 Difference]: Without dead ends: 524 [2021-06-05 04:27:52,958 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 503.5ms TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:27:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-06-05 04:27:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 454. [2021-06-05 04:27:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.2891832229580573) internal successors, (1490), 453 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1490 transitions. [2021-06-05 04:27:52,963 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1490 transitions. Word has length 18 [2021-06-05 04:27:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:52,963 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1490 transitions. [2021-06-05 04:27:52,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1490 transitions. [2021-06-05 04:27:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:52,964 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:52,964 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:53,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2754 [2021-06-05 04:27:53,164 INFO L430 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1746091684, now seen corresponding path program 106 times [2021-06-05 04:27:53,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:53,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39652857] [2021-06-05 04:27:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:53,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:53,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39652857] [2021-06-05 04:27:53,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39652857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:53,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787747582] [2021-06-05 04:27:53,427 INFO L93 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 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:53,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:27:53,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:53,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:53,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:53,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:53,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:53,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:53,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:53,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:53,585 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 04:27:53,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:53,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:53,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:53,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:53,649 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:53,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:53,652 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:53,655 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:53,710 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 04:27:53,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:53,714 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:53,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:53,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:53,737 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:27:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:53,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787747582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:53,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:53,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:27:53,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182978514] [2021-06-05 04:27:53,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:27:53,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:27:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:53,841 INFO L87 Difference]: Start difference. First operand 454 states and 1490 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:54,321 INFO L93 Difference]: Finished difference Result 539 states and 1713 transitions. [2021-06-05 04:27:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:54,322 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:54,323 INFO L225 Difference]: With dead ends: 539 [2021-06-05 04:27:54,323 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 04:27:54,323 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 661.3ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:27:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 04:27:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 451. [2021-06-05 04:27:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.2844444444444445) internal successors, (1478), 450 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1478 transitions. [2021-06-05 04:27:54,328 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1478 transitions. Word has length 18 [2021-06-05 04:27:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:54,328 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1478 transitions. [2021-06-05 04:27:54,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1478 transitions. [2021-06-05 04:27:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:54,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:54,329 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:54,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 253 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2764 [2021-06-05 04:27:54,529 INFO L430 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1675134932, now seen corresponding path program 107 times [2021-06-05 04:27:54,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:54,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975823286] [2021-06-05 04:27:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:54,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:54,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975823286] [2021-06-05 04:27:54,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975823286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:54,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084719726] [2021-06-05 04:27:54,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:54,761 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:27:54,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:54,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:54,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:54,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:54,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:54,874 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:54,874 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:27:54,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:54,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:54,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:54,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:54,926 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:54,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:54,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:54,932 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:54,967 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 04:27:54,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:54,970 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:54,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:54,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:54,985 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:27:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:55,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084719726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:55,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:55,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:55,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133420477] [2021-06-05 04:27:55,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:55,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:55,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:55,048 INFO L87 Difference]: Start difference. First operand 451 states and 1478 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:55,585 INFO L93 Difference]: Finished difference Result 534 states and 1710 transitions. [2021-06-05 04:27:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:27:55,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:55,586 INFO L225 Difference]: With dead ends: 534 [2021-06-05 04:27:55,586 INFO L226 Difference]: Without dead ends: 529 [2021-06-05 04:27:55,586 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 562.8ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:27:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-06-05 04:27:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 448. [2021-06-05 04:27:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.286353467561521) internal successors, (1469), 447 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1469 transitions. [2021-06-05 04:27:55,591 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1469 transitions. Word has length 18 [2021-06-05 04:27:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:55,591 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1469 transitions. [2021-06-05 04:27:55,591 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1469 transitions. [2021-06-05 04:27:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:55,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:55,592 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:55,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2774,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:55,793 INFO L430 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1103680126, now seen corresponding path program 108 times [2021-06-05 04:27:55,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:55,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389591365] [2021-06-05 04:27:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:56,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:56,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389591365] [2021-06-05 04:27:56,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389591365] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:56,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105285369] [2021-06-05 04:27:56,006 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:56,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:27:56,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:56,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:56,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:56,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:56,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:56,116 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:56,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:56,119 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:56,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:56,139 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:56,139 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 04:27:56,223 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_784], 1=[array_4, v_prenex_785]} [2021-06-05 04:27:56,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:56,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:56,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:27:56,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:56,269 INFO L628 ElimStorePlain]: treesize reduction 85, result has 37.0 percent of original size [2021-06-05 04:27:56,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:27:56,272 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:56,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:56,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:56,289 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:56,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:56,302 INFO L518 ElimStorePlain]: Eliminatee v_prenex_785 vanished before elimination [2021-06-05 04:27:56,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:56,303 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:27:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:56,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105285369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:56,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:56,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:56,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346267458] [2021-06-05 04:27:56,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:56,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:56,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:56,365 INFO L87 Difference]: Start difference. First operand 448 states and 1469 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:57,079 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 04:27:57,198 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 04:27:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:57,264 INFO L93 Difference]: Finished difference Result 578 states and 1826 transitions. [2021-06-05 04:27:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:27:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:57,265 INFO L225 Difference]: With dead ends: 578 [2021-06-05 04:27:57,265 INFO L226 Difference]: Without dead ends: 568 [2021-06-05 04:27:57,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 872.7ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:27:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-06-05 04:27:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 454. [2021-06-05 04:27:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.282560706401766) internal successors, (1487), 453 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1487 transitions. [2021-06-05 04:27:57,271 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1487 transitions. Word has length 18 [2021-06-05 04:27:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:57,271 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1487 transitions. [2021-06-05 04:27:57,271 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1487 transitions. [2021-06-05 04:27:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:57,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:57,271 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:57,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2784 [2021-06-05 04:27:57,472 INFO L430 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1529859260, now seen corresponding path program 109 times [2021-06-05 04:27:57,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:57,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098260176] [2021-06-05 04:27:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:57,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:57,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098260176] [2021-06-05 04:27:57,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098260176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:57,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722242170] [2021-06-05 04:27:57,649 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:57,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:27:57,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:57,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:57,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:57,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:57,770 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:57,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:57,787 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 04:27:57,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:57,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:57,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:57,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:27:57,909 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:57,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:57,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:57,915 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:57,952 INFO L628 ElimStorePlain]: treesize reduction 73, result has 38.7 percent of original size [2021-06-05 04:27:57,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:57,955 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:57,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:57,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:57,970 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 04:27:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:58,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722242170] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:58,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:58,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:27:58,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063299954] [2021-06-05 04:27:58,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:27:58,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:27:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:27:58,028 INFO L87 Difference]: Start difference. First operand 454 states and 1487 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:27:59,156 INFO L93 Difference]: Finished difference Result 602 states and 1889 transitions. [2021-06-05 04:27:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:27:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:27:59,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:27:59,157 INFO L225 Difference]: With dead ends: 602 [2021-06-05 04:27:59,157 INFO L226 Difference]: Without dead ends: 578 [2021-06-05 04:27:59,158 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1101.2ms TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2021-06-05 04:27:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-06-05 04:27:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 464. [2021-06-05 04:27:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 04:27:59,163 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 04:27:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:27:59,163 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 04:27:59,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:27:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 04:27:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:27:59,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:27:59,164 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:27:59,364 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2796,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:59,364 INFO L430 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:27:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:27:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash 816041682, now seen corresponding path program 110 times [2021-06-05 04:27:59,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:27:59,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513475479] [2021-06-05 04:27:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:27:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:27:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:59,615 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:27:59,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513475479] [2021-06-05 04:27:59,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513475479] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:59,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071271190] [2021-06-05 04:27:59,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:27:59,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:27:59,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:27:59,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:27:59,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:27:59,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:27:59,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:27:59,754 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:59,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:27:59,757 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:59,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:59,778 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:59,778 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:27:59,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:27:59,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:59,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:27:59,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:27:59,872 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:27:59,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:27:59,874 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:27:59,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:27:59,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:27:59,881 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:27:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:27:59,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071271190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:27:59,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:27:59,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:27:59,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991736278] [2021-06-05 04:27:59,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:27:59,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:27:59,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:27:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:27:59,906 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:00,344 INFO L93 Difference]: Finished difference Result 540 states and 1723 transitions. [2021-06-05 04:28:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:00,345 INFO L225 Difference]: With dead ends: 540 [2021-06-05 04:28:00,345 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 04:28:00,345 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 536.7ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 04:28:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 470. [2021-06-05 04:28:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.279317697228145) internal successors, (1538), 469 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1538 transitions. [2021-06-05 04:28:00,350 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1538 transitions. Word has length 18 [2021-06-05 04:28:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:00,350 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1538 transitions. [2021-06-05 04:28:00,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1538 transitions. [2021-06-05 04:28:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:00,351 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:00,351 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:00,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2806 [2021-06-05 04:28:00,552 INFO L430 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1123947064, now seen corresponding path program 111 times [2021-06-05 04:28:00,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:00,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796856633] [2021-06-05 04:28:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:00,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:00,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796856633] [2021-06-05 04:28:00,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796856633] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:00,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954311008] [2021-06-05 04:28:00,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:00,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:28:00,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:00,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:00,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:00,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:00,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:00,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:00,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:00,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:00,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:00,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:00,947 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:28:00,996 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_786], 1=[array_4, v_prenex_787]} [2021-06-05 04:28:00,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:00,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:01,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:01,002 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:01,042 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 04:28:01,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:01,045 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:01,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:01,059 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:01,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:01,062 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:01,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:01,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:01,077 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:28:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:01,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954311008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:01,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:01,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:01,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406497593] [2021-06-05 04:28:01,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:01,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:01,137 INFO L87 Difference]: Start difference. First operand 470 states and 1538 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:01,567 INFO L93 Difference]: Finished difference Result 550 states and 1755 transitions. [2021-06-05 04:28:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:01,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:01,568 INFO L225 Difference]: With dead ends: 550 [2021-06-05 04:28:01,568 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 04:28:01,568 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 508.2ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 04:28:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 464. [2021-06-05 04:28:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 04:28:01,573 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 04:28:01,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:01,573 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 04:28:01,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 04:28:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:01,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:01,574 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:01,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2816,258 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:01,777 INFO L430 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:01,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1997687744, now seen corresponding path program 112 times [2021-06-05 04:28:01,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:01,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923528700] [2021-06-05 04:28:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:01,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:01,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923528700] [2021-06-05 04:28:01,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923528700] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:01,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031915899] [2021-06-05 04:28:01,986 INFO L93 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 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:02,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:02,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:02,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:28:02,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:02,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:02,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:02,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:02,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:02,137 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:28:02,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:02,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:02,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:02,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:02,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:02,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:02,192 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:02,199 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:02,234 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 04:28:02,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:02,237 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:02,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:02,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:02,251 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:28:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:02,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031915899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:02,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:02,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:02,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25697472] [2021-06-05 04:28:02,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:02,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:02,313 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:03,033 INFO L93 Difference]: Finished difference Result 548 states and 1754 transitions. [2021-06-05 04:28:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:03,033 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:03,034 INFO L225 Difference]: With dead ends: 548 [2021-06-05 04:28:03,034 INFO L226 Difference]: Without dead ends: 543 [2021-06-05 04:28:03,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 728.9ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:28:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-06-05 04:28:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 465. [2021-06-05 04:28:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.2780172413793105) internal successors, (1521), 464 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1521 transitions. [2021-06-05 04:28:03,039 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1521 transitions. Word has length 18 [2021-06-05 04:28:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:03,039 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1521 transitions. [2021-06-05 04:28:03,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1521 transitions. [2021-06-05 04:28:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:03,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:03,040 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:03,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2827,259 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:03,245 INFO L430 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:03,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1275381276, now seen corresponding path program 113 times [2021-06-05 04:28:03,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:03,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275246426] [2021-06-05 04:28:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:03,519 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:03,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275246426] [2021-06-05 04:28:03,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275246426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:03,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846521624] [2021-06-05 04:28:03,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:03,546 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:03,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:03,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:03,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:03,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:03,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:03,614 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:03,618 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:03,621 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:03,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:03,660 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 04:28:03,941 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:28:03,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:03,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:03,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:03,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:03,954 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:03,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:03,957 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:04,010 INFO L628 ElimStorePlain]: treesize reduction 87, result has 40.0 percent of original size [2021-06-05 04:28:04,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:04,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:04,014 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:04,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:04,034 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:04,035 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:38 [2021-06-05 04:28:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:04,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846521624] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:04,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:04,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:28:04,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546141426] [2021-06-05 04:28:04,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:04,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:04,095 INFO L87 Difference]: Start difference. First operand 465 states and 1521 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:04,286 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-06-05 04:28:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:04,709 INFO L93 Difference]: Finished difference Result 633 states and 1928 transitions. [2021-06-05 04:28:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:04,710 INFO L225 Difference]: With dead ends: 633 [2021-06-05 04:28:04,710 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 04:28:04,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 866.9ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 04:28:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 470. [2021-06-05 04:28:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.275053304904051) internal successors, (1536), 469 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1536 transitions. [2021-06-05 04:28:04,716 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1536 transitions. Word has length 18 [2021-06-05 04:28:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:04,716 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1536 transitions. [2021-06-05 04:28:04,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1536 transitions. [2021-06-05 04:28:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:04,717 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:04,717 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:04,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2838,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:04,919 INFO L430 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2131877222, now seen corresponding path program 114 times [2021-06-05 04:28:04,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:04,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558434470] [2021-06-05 04:28:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:05,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:05,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558434470] [2021-06-05 04:28:05,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558434470] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:05,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26220017] [2021-06-05 04:28:05,158 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:05,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:28:05,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:05,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:05,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:05,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:05,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:05,265 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:05,269 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:05,273 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:05,314 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:05,314 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:05,586 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_795], 1=[array_2, v_prenex_794]} [2021-06-05 04:28:05,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:05,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:05,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,625 INFO L628 ElimStorePlain]: treesize reduction 63, result has 44.7 percent of original size [2021-06-05 04:28:05,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:05,628 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:05,639 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:28:05,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:05,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:05,641 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:05,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:05,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:05,652 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 04:28:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:05,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26220017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:05,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:05,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:05,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505614146] [2021-06-05 04:28:05,667 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:05,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:05,668 INFO L87 Difference]: Start difference. First operand 470 states and 1536 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:06,256 INFO L93 Difference]: Finished difference Result 615 states and 1900 transitions. [2021-06-05 04:28:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:06,258 INFO L225 Difference]: With dead ends: 615 [2021-06-05 04:28:06,258 INFO L226 Difference]: Without dead ends: 610 [2021-06-05 04:28:06,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 726.4ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-06-05 04:28:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 473. [2021-06-05 04:28:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2796610169491527) internal successors, (1548), 472 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1548 transitions. [2021-06-05 04:28:06,264 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1548 transitions. Word has length 18 [2021-06-05 04:28:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:06,264 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1548 transitions. [2021-06-05 04:28:06,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1548 transitions. [2021-06-05 04:28:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:06,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:06,264 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:06,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2855 [2021-06-05 04:28:06,465 INFO L430 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:06,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash 191888476, now seen corresponding path program 115 times [2021-06-05 04:28:06,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:06,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252823251] [2021-06-05 04:28:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:06,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:06,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252823251] [2021-06-05 04:28:06,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252823251] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:06,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025429427] [2021-06-05 04:28:06,684 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:06,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:06,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:06,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:06,782 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:06,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:06,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:06,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:06,790 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:06,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:06,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:06,793 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:06,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:06,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:06,830 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:07,050 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 04:28:07,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:07,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:07,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:07,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:07,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:07,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:07,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:07,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:07,063 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:07,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:07,067 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:07,129 INFO L628 ElimStorePlain]: treesize reduction 101, result has 40.9 percent of original size [2021-06-05 04:28:07,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:07,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:07,133 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:07,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:07,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:07,161 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:205, output treesize:50 [2021-06-05 04:28:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:07,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025429427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:07,251 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:07,251 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:28:07,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372626429] [2021-06-05 04:28:07,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:28:07,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:28:07,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:07,251 INFO L87 Difference]: Start difference. First operand 473 states and 1548 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:07,868 INFO L93 Difference]: Finished difference Result 629 states and 1937 transitions. [2021-06-05 04:28:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:07,869 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:07,870 INFO L225 Difference]: With dead ends: 629 [2021-06-05 04:28:07,870 INFO L226 Difference]: Without dead ends: 617 [2021-06-05 04:28:07,870 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 728.4ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-06-05 04:28:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 472. [2021-06-05 04:28:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.26963906581741) internal successors, (1540), 471 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1540 transitions. [2021-06-05 04:28:07,875 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1540 transitions. Word has length 18 [2021-06-05 04:28:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:07,876 INFO L482 AbstractCegarLoop]: Abstraction has 472 states and 1540 transitions. [2021-06-05 04:28:07,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1540 transitions. [2021-06-05 04:28:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:07,876 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:07,876 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:08,076 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2874,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:08,077 INFO L430 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1976445854, now seen corresponding path program 116 times [2021-06-05 04:28:08,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:08,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146928268] [2021-06-05 04:28:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:28:08,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:08,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146928268] [2021-06-05 04:28:08,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146928268] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:08,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147057373] [2021-06-05 04:28:08,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:08,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:08,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:08,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:28:08,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:08,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:28:08,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:08,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:08,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:08,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:08,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:28:08,206 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:08,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:08,215 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:08,215 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:21 [2021-06-05 04:28:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:28:08,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147057373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:08,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:08,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 04:28:08,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334776153] [2021-06-05 04:28:08,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:28:08,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:28:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:28:08,309 INFO L87 Difference]: Start difference. First operand 472 states and 1540 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:08,893 INFO L93 Difference]: Finished difference Result 959 states and 2931 transitions. [2021-06-05 04:28:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:28:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:08,895 INFO L225 Difference]: With dead ends: 959 [2021-06-05 04:28:08,895 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 04:28:08,895 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 509.4ms TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:28:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 04:28:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 546. [2021-06-05 04:28:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.388990825688073) internal successors, (1847), 545 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1847 transitions. [2021-06-05 04:28:08,902 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1847 transitions. Word has length 18 [2021-06-05 04:28:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:08,902 INFO L482 AbstractCegarLoop]: Abstraction has 546 states and 1847 transitions. [2021-06-05 04:28:08,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1847 transitions. [2021-06-05 04:28:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:08,903 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:08,903 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:09,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 263 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2887 [2021-06-05 04:28:09,104 INFO L430 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:09,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2058487706, now seen corresponding path program 117 times [2021-06-05 04:28:09,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:09,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998102545] [2021-06-05 04:28:09,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:09,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:09,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998102545] [2021-06-05 04:28:09,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998102545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:09,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073266903] [2021-06-05 04:28:09,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:09,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:28:09,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:09,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:09,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:09,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:09,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:09,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:09,493 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:09,496 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:09,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:09,525 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 04:28:09,781 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:28:09,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:09,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:09,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:09,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:09,796 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:09,846 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 04:28:09,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:09,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:09,850 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:09,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:09,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:09,869 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 04:28:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:09,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073266903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:09,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:09,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:28:09,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242166589] [2021-06-05 04:28:09,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:28:09,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:28:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:09,928 INFO L87 Difference]: Start difference. First operand 546 states and 1847 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:10,307 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 04:28:10,607 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-06-05 04:28:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:10,946 INFO L93 Difference]: Finished difference Result 669 states and 2169 transitions. [2021-06-05 04:28:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:28:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:10,948 INFO L225 Difference]: With dead ends: 669 [2021-06-05 04:28:10,948 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 04:28:10,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1127.7ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:28:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 04:28:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 544. [2021-06-05 04:28:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.394106813996317) internal successors, (1843), 543 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1843 transitions. [2021-06-05 04:28:10,954 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1843 transitions. Word has length 18 [2021-06-05 04:28:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:10,954 INFO L482 AbstractCegarLoop]: Abstraction has 544 states and 1843 transitions. [2021-06-05 04:28:10,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1843 transitions. [2021-06-05 04:28:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:10,955 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:10,955 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:11,155 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2894 [2021-06-05 04:28:11,155 INFO L430 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:11,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash -264932768, now seen corresponding path program 118 times [2021-06-05 04:28:11,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:11,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066260207] [2021-06-05 04:28:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:11,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:11,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066260207] [2021-06-05 04:28:11,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066260207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:11,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390520387] [2021-06-05 04:28:11,220 INFO L93 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 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:11,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:11,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:11,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:28:11,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:11,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:11,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:11,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:11,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:11,307 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:11,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:11,310 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:11,313 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:11,337 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:11,337 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 04:28:11,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:11,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:11,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:11,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,430 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:28:11,430 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:11,433 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:11,436 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,437 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:28:11,438 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:28:11,440 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:11,442 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:11,467 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 04:28:11,468 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:11,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:11,468 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 04:28:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:11,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390520387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:11,502 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:11,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 04:28:11,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443521667] [2021-06-05 04:28:11,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:11,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:11,503 INFO L87 Difference]: Start difference. First operand 544 states and 1843 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:12,925 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-06-05 04:28:13,059 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-06-05 04:28:13,766 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 04:28:14,575 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 04:28:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:14,826 INFO L93 Difference]: Finished difference Result 1295 states and 3899 transitions. [2021-06-05 04:28:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 04:28:14,826 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:14,828 INFO L225 Difference]: With dead ends: 1295 [2021-06-05 04:28:14,828 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 04:28:14,828 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2750.0ms TimeCoverageRelationStatistics Valid=603, Invalid=2477, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 04:28:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 04:28:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 636. [2021-06-05 04:28:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 04:28:14,838 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 04:28:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:14,838 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 04:28:14,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 04:28:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:14,839 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:14,839 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:15,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2911,265 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:15,039 INFO L430 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1095578010, now seen corresponding path program 119 times [2021-06-05 04:28:15,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:15,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630189336] [2021-06-05 04:28:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:15,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:15,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630189336] [2021-06-05 04:28:15,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630189336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:15,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216800594] [2021-06-05 04:28:15,222 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:15,250 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:15,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:15,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:15,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:15,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:15,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:15,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:15,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:15,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:15,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:15,426 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:28:15,426 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-06-05 04:28:15,544 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_807], 1=[array_2, v_prenex_806]} [2021-06-05 04:28:15,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:15,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:15,551 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,584 INFO L628 ElimStorePlain]: treesize reduction 63, result has 45.7 percent of original size [2021-06-05 04:28:15,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:15,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:15,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:15,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:15,600 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:15,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:15,609 INFO L518 ElimStorePlain]: Eliminatee v_prenex_806 vanished before elimination [2021-06-05 04:28:15,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:15,610 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 04:28:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:15,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216800594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:15,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:15,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:15,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522267450] [2021-06-05 04:28:15,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:15,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:15,626 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:15,979 INFO L93 Difference]: Finished difference Result 730 states and 2543 transitions. [2021-06-05 04:28:15,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:15,981 INFO L225 Difference]: With dead ends: 730 [2021-06-05 04:28:15,981 INFO L226 Difference]: Without dead ends: 725 [2021-06-05 04:28:15,981 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 385.2ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-06-05 04:28:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 642. [2021-06-05 04:28:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.5709828393135727) internal successors, (2289), 641 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2289 transitions. [2021-06-05 04:28:15,988 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2289 transitions. Word has length 18 [2021-06-05 04:28:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:15,988 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2289 transitions. [2021-06-05 04:28:15,989 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2289 transitions. [2021-06-05 04:28:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:15,990 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:15,990 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:16,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2922 [2021-06-05 04:28:16,190 INFO L430 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:16,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1259400540, now seen corresponding path program 120 times [2021-06-05 04:28:16,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:16,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939642816] [2021-06-05 04:28:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:16,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:16,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939642816] [2021-06-05 04:28:16,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939642816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:16,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833630425] [2021-06-05 04:28:16,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:16,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:28:16,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:16,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:16,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:16,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:16,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:16,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:16,545 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:28:16,545 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:75 [2021-06-05 04:28:16,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:16,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:16,622 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,677 INFO L628 ElimStorePlain]: treesize reduction 91, result has 42.0 percent of original size [2021-06-05 04:28:16,678 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:16,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:16,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:16,681 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:16,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:16,702 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:16,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:16,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:16,721 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 04:28:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:16,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833630425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:16,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:16,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:16,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442631217] [2021-06-05 04:28:16,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:16,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:16,770 INFO L87 Difference]: Start difference. First operand 642 states and 2289 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:17,105 INFO L93 Difference]: Finished difference Result 740 states and 2575 transitions. [2021-06-05 04:28:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:17,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:17,106 INFO L225 Difference]: With dead ends: 740 [2021-06-05 04:28:17,106 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 04:28:17,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 342.9ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 04:28:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 636. [2021-06-05 04:28:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 04:28:17,114 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 04:28:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:17,114 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 04:28:17,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 04:28:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:17,115 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:17,115 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:17,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2939,267 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:17,315 INFO L430 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 385659860, now seen corresponding path program 121 times [2021-06-05 04:28:17,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:17,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019979749] [2021-06-05 04:28:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:17,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:17,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019979749] [2021-06-05 04:28:17,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019979749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:17,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128390295] [2021-06-05 04:28:17,510 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:17,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:17,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:17,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:17,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:17,648 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:17,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:17,663 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:28:17,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:17,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:17,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:17,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:17,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:17,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:17,718 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:17,721 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,757 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:28:17,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:17,759 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:17,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:17,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:17,773 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:28:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:17,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128390295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:17,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:17,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:17,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833826719] [2021-06-05 04:28:17,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:17,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:17,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:17,834 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:18,491 INFO L93 Difference]: Finished difference Result 735 states and 2565 transitions. [2021-06-05 04:28:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:18,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:18,493 INFO L225 Difference]: With dead ends: 735 [2021-06-05 04:28:18,493 INFO L226 Difference]: Without dead ends: 730 [2021-06-05 04:28:18,493 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 688.5ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:28:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-05 04:28:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 636. [2021-06-05 04:28:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 04:28:18,500 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 04:28:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:18,500 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 04:28:18,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 04:28:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:18,501 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:18,501 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:18,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 268 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2956 [2021-06-05 04:28:18,702 INFO L430 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:18,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:18,702 INFO L82 PathProgramCache]: Analyzing trace with hash 934576270, now seen corresponding path program 122 times [2021-06-05 04:28:18,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:18,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154045476] [2021-06-05 04:28:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:18,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:18,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154045476] [2021-06-05 04:28:18,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154045476] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:18,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759948571] [2021-06-05 04:28:18,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:18,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:18,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:18,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:18,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:19,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:19,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:19,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:19,057 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:19,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:19,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:19,111 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:28:19,385 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_815, array_4], 1=[v_prenex_814, array_2]} [2021-06-05 04:28:19,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:19,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:19,392 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,432 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 04:28:19,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:28:19,435 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:19,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:19,448 INFO L518 ElimStorePlain]: Eliminatee v_prenex_814 vanished before elimination [2021-06-05 04:28:19,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:19,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:28:19,452 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:19,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:19,466 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:19,466 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 04:28:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:19,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759948571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:19,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:19,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:19,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335846707] [2021-06-05 04:28:19,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:19,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:19,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:19,483 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:19,733 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2021-06-05 04:28:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:19,939 INFO L93 Difference]: Finished difference Result 733 states and 2549 transitions. [2021-06-05 04:28:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:19,940 INFO L225 Difference]: With dead ends: 733 [2021-06-05 04:28:19,940 INFO L226 Difference]: Without dead ends: 728 [2021-06-05 04:28:19,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 670.1ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2021-06-05 04:28:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 640. [2021-06-05 04:28:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.575899843505477) internal successors, (2285), 639 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 2285 transitions. [2021-06-05 04:28:19,947 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 2285 transitions. Word has length 18 [2021-06-05 04:28:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:19,947 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 2285 transitions. [2021-06-05 04:28:19,947 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 2285 transitions. [2021-06-05 04:28:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:19,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:19,948 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:20,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2966 [2021-06-05 04:28:20,149 INFO L430 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1005412476, now seen corresponding path program 123 times [2021-06-05 04:28:20,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:20,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818518344] [2021-06-05 04:28:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:20,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:20,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818518344] [2021-06-05 04:28:20,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818518344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:20,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161898377] [2021-06-05 04:28:20,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:20,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:28:20,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:20,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:20,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:20,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:20,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:20,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:20,490 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:20,493 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:20,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:20,532 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 04:28:20,721 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:28:20,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:20,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:20,729 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:20,733 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:20,736 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:20,786 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 04:28:20,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:20,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:20,790 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:20,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:20,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:20,808 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:28:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:20,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161898377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:20,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:20,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:20,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138467373] [2021-06-05 04:28:20,858 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:20,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:20,859 INFO L87 Difference]: Start difference. First operand 640 states and 2285 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:21,128 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-06-05 04:28:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:21,462 INFO L93 Difference]: Finished difference Result 749 states and 2603 transitions. [2021-06-05 04:28:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:21,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:21,464 INFO L225 Difference]: With dead ends: 749 [2021-06-05 04:28:21,464 INFO L226 Difference]: Without dead ends: 744 [2021-06-05 04:28:21,464 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 715.6ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-06-05 04:28:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 635. [2021-06-05 04:28:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 3.5709779179810726) internal successors, (2264), 634 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 2264 transitions. [2021-06-05 04:28:21,471 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 2264 transitions. Word has length 18 [2021-06-05 04:28:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:21,471 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 2264 transitions. [2021-06-05 04:28:21,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 2264 transitions. [2021-06-05 04:28:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:21,472 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:21,472 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:21,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2985,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:21,673 INFO L430 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1141669252, now seen corresponding path program 124 times [2021-06-05 04:28:21,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:21,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095591955] [2021-06-05 04:28:21,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:21,874 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:21,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095591955] [2021-06-05 04:28:21,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095591955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:21,874 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522997397] [2021-06-05 04:28:21,874 INFO L93 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 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:21,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:21,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:21,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:28:21,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:21,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:21,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:21,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:21,998 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:22,002 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:22,006 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:22,009 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:22,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:22,069 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:157 [2021-06-05 04:28:22,299 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 04:28:22,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:22,303 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:22,307 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:22,311 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:22,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:22,384 INFO L628 ElimStorePlain]: treesize reduction 95, result has 42.4 percent of original size [2021-06-05 04:28:22,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:22,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:22,389 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:22,415 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:22,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:22,416 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:197, output treesize:50 [2021-06-05 04:28:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:22,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522997397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:22,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:22,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:28:22,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920112248] [2021-06-05 04:28:22,507 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:28:22,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:28:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:22,507 INFO L87 Difference]: Start difference. First operand 635 states and 2264 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:22,799 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-06-05 04:28:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:23,016 INFO L93 Difference]: Finished difference Result 739 states and 2574 transitions. [2021-06-05 04:28:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:23,018 INFO L225 Difference]: With dead ends: 739 [2021-06-05 04:28:23,018 INFO L226 Difference]: Without dead ends: 726 [2021-06-05 04:28:23,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 693.2ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:28:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-06-05 04:28:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 642. [2021-06-05 04:28:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 04:28:23,025 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 04:28:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:23,025 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 04:28:23,025 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 04:28:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:23,026 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:23,026 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:23,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3002,271 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:23,227 INFO L430 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1750500672, now seen corresponding path program 125 times [2021-06-05 04:28:23,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:23,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296941857] [2021-06-05 04:28:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:23,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:23,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296941857] [2021-06-05 04:28:23,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296941857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:23,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58456026] [2021-06-05 04:28:23,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:23,474 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:28:23,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:23,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:23,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:23,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:23,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:23,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:23,592 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:23,592 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 04:28:23,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:23,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:23,646 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:23,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:23,649 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:23,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:23,652 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:23,655 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:23,689 INFO L628 ElimStorePlain]: treesize reduction 78, result has 35.5 percent of original size [2021-06-05 04:28:23,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:23,692 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:23,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:23,706 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:23,706 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:28:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:23,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58456026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:23,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:23,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:23,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621051930] [2021-06-05 04:28:23,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:23,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:23,767 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:24,507 INFO L93 Difference]: Finished difference Result 769 states and 2676 transitions. [2021-06-05 04:28:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:24,509 INFO L225 Difference]: With dead ends: 769 [2021-06-05 04:28:24,509 INFO L226 Difference]: Without dead ends: 764 [2021-06-05 04:28:24,509 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 744.2ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:28:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-06-05 04:28:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 642. [2021-06-05 04:28:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 04:28:24,516 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 04:28:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:24,516 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 04:28:24,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 04:28:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:24,517 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:24,517 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:24,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3018,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:24,718 INFO L430 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1973011818, now seen corresponding path program 126 times [2021-06-05 04:28:24,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:24,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166530939] [2021-06-05 04:28:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:25,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:25,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166530939] [2021-06-05 04:28:25,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166530939] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:25,060 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082746538] [2021-06-05 04:28:25,060 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:25,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:28:25,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:25,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:25,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:25,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:25,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:25,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:25,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:25,198 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:25,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:25,215 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:25,215 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 04:28:25,300 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_822, array_0], 1=[v_prenex_823, array_4]} [2021-06-05 04:28:25,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:25,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:25,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:25,309 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:25,353 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 04:28:25,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:25,356 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:25,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:25,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:25,372 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:25,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:25,386 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:25,386 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:25,387 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:28:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:25,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082746538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:25,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:25,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:25,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821885108] [2021-06-05 04:28:25,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:25,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:25,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:25,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:25,449 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:26,294 INFO L93 Difference]: Finished difference Result 826 states and 2842 transitions. [2021-06-05 04:28:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:28:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:26,296 INFO L225 Difference]: With dead ends: 826 [2021-06-05 04:28:26,296 INFO L226 Difference]: Without dead ends: 816 [2021-06-05 04:28:26,296 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 844.1ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:28:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-06-05 04:28:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 642. [2021-06-05 04:28:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 04:28:26,304 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 04:28:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:26,304 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 04:28:26,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 04:28:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:26,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:26,305 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:26,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3028,273 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:26,505 INFO L430 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -881797318, now seen corresponding path program 127 times [2021-06-05 04:28:26,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:26,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451965406] [2021-06-05 04:28:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:26,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:26,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451965406] [2021-06-05 04:28:26,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451965406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:26,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093457325] [2021-06-05 04:28:26,757 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:26,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:28:26,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:26,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:26,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:26,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:26,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:26,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:26,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:26,922 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:26,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:26,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:28:26,945 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:66 [2021-06-05 04:28:27,011 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 04:28:27,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:27,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:27,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:27,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:27,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:27,019 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:27,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:27,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:27,023 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:27,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:27,026 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:27,075 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 04:28:27,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:27,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:27,079 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:27,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:27,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:27,098 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:28:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:27,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093457325] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:27,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:27,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 04:28:27,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344038797] [2021-06-05 04:28:27,161 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:27,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:27,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:27,161 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:27,743 INFO L93 Difference]: Finished difference Result 738 states and 2579 transitions. [2021-06-05 04:28:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:27,745 INFO L225 Difference]: With dead ends: 738 [2021-06-05 04:28:27,745 INFO L226 Difference]: Without dead ends: 733 [2021-06-05 04:28:27,745 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 629.7ms TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-06-05 04:28:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 639. [2021-06-05 04:28:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.5768025078369905) internal successors, (2282), 638 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2282 transitions. [2021-06-05 04:28:27,752 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2282 transitions. Word has length 18 [2021-06-05 04:28:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:27,752 INFO L482 AbstractCegarLoop]: Abstraction has 639 states and 2282 transitions. [2021-06-05 04:28:27,752 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2282 transitions. [2021-06-05 04:28:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:27,753 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:27,753 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:27,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 274 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3042 [2021-06-05 04:28:27,954 INFO L430 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -125787926, now seen corresponding path program 128 times [2021-06-05 04:28:27,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:27,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066516260] [2021-06-05 04:28:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:28,142 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-06-05 04:28:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:28,260 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:28,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066516260] [2021-06-05 04:28:28,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066516260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:28,260 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015332256] [2021-06-05 04:28:28,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:28,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:28,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:28,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:28,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:28,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:28,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:28,400 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:28,404 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:28,407 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:28,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:28,448 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 04:28:28,629 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 04:28:28,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:28,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:28,638 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:28,642 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:28,646 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:28,690 INFO L628 ElimStorePlain]: treesize reduction 76, result has 42.0 percent of original size [2021-06-05 04:28:28,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:28,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:28,694 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:28,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:28,713 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:28,713 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 04:28:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:28,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015332256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:28,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:28,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:28:28,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085524771] [2021-06-05 04:28:28,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:28:28,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:28:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:28,773 INFO L87 Difference]: Start difference. First operand 639 states and 2282 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:29,031 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-06-05 04:28:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:29,273 INFO L93 Difference]: Finished difference Result 740 states and 2591 transitions. [2021-06-05 04:28:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:29,274 INFO L225 Difference]: With dead ends: 740 [2021-06-05 04:28:29,274 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 04:28:29,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 749.2ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 04:28:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 641. [2021-06-05 04:28:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.5796875) internal successors, (2291), 640 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2291 transitions. [2021-06-05 04:28:29,282 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 2291 transitions. Word has length 18 [2021-06-05 04:28:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:29,282 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 2291 transitions. [2021-06-05 04:28:29,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 2291 transitions. [2021-06-05 04:28:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:29,283 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:29,283 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:29,483 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 275 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3055 [2021-06-05 04:28:29,483 INFO L430 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash -360500806, now seen corresponding path program 129 times [2021-06-05 04:28:29,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:29,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217170138] [2021-06-05 04:28:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:29,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:29,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217170138] [2021-06-05 04:28:29,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217170138] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:29,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129322711] [2021-06-05 04:28:29,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:29,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:28:29,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:29,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:29,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:29,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:29,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:29,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:29,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:29,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:29,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:29,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:29,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:29,909 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:29,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:29,911 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:29,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:29,935 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:29,935 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 04:28:30,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:30,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:30,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:30,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:30,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:30,054 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:30,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:30,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:30,057 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:30,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:30,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:30,095 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 04:28:30,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:30,098 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:30,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:30,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:30,112 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:28:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:30,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129322711] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:30,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:30,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:30,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476393941] [2021-06-05 04:28:30,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:30,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:30,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:30,187 INFO L87 Difference]: Start difference. First operand 641 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:30,527 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-06-05 04:28:31,092 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 04:28:31,235 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 04:28:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:31,306 INFO L93 Difference]: Finished difference Result 830 states and 2856 transitions. [2021-06-05 04:28:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:31,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:31,308 INFO L225 Difference]: With dead ends: 830 [2021-06-05 04:28:31,308 INFO L226 Difference]: Without dead ends: 825 [2021-06-05 04:28:31,308 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1151.0ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:28:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-06-05 04:28:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 643. [2021-06-05 04:28:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.5794392523364484) internal successors, (2298), 642 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2298 transitions. [2021-06-05 04:28:31,316 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2298 transitions. Word has length 18 [2021-06-05 04:28:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:31,316 INFO L482 AbstractCegarLoop]: Abstraction has 643 states and 2298 transitions. [2021-06-05 04:28:31,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2298 transitions. [2021-06-05 04:28:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:31,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:31,317 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:31,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3069,276 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:31,517 INFO L430 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 914447872, now seen corresponding path program 130 times [2021-06-05 04:28:31,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:31,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694945301] [2021-06-05 04:28:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:31,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:31,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694945301] [2021-06-05 04:28:31,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694945301] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:31,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273956488] [2021-06-05 04:28:31,854 INFO L93 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 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:31,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:31,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:31,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:31,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:31,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:31,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:31,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:31,956 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:31,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:31,959 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:31,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:31,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:31,963 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:32,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:32,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:32,002 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:32,252 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 04:28:32,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:32,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:32,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:32,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:32,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:32,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:32,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:32,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:32,265 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:32,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:32,268 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:32,339 INFO L628 ElimStorePlain]: treesize reduction 105, result has 40.0 percent of original size [2021-06-05 04:28:32,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:32,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:32,343 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:32,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:32,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:32,371 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:205, output treesize:50 [2021-06-05 04:28:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:32,462 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273956488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:32,462 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:32,462 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:28:32,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785223124] [2021-06-05 04:28:32,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:28:32,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:28:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:32,463 INFO L87 Difference]: Start difference. First operand 643 states and 2298 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:32,819 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2021-06-05 04:28:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:33,057 INFO L93 Difference]: Finished difference Result 770 states and 2654 transitions. [2021-06-05 04:28:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:33,059 INFO L225 Difference]: With dead ends: 770 [2021-06-05 04:28:33,059 INFO L226 Difference]: Without dead ends: 757 [2021-06-05 04:28:33,059 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 874.2ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-06-05 04:28:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 642. [2021-06-05 04:28:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.578783151326053) internal successors, (2294), 641 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2294 transitions. [2021-06-05 04:28:33,066 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2294 transitions. Word has length 18 [2021-06-05 04:28:33,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:33,066 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2294 transitions. [2021-06-05 04:28:33,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2294 transitions. [2021-06-05 04:28:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:33,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:33,067 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:33,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 277 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3083 [2021-06-05 04:28:33,268 INFO L430 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash 903035708, now seen corresponding path program 131 times [2021-06-05 04:28:33,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:33,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132922443] [2021-06-05 04:28:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:28:33,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:33,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132922443] [2021-06-05 04:28:33,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132922443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:33,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338981068] [2021-06-05 04:28:33,329 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:33,362 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:33,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:33,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:28:33,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:33,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:28:33,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:33,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:33,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:33,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:33,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:28:33,425 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:33,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:33,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:33,441 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:28:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:28:33,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338981068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:33,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:33,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 04:28:33,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137342067] [2021-06-05 04:28:33,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:28:33,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:33,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:28:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:28:33,542 INFO L87 Difference]: Start difference. First operand 642 states and 2294 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:34,189 INFO L93 Difference]: Finished difference Result 1043 states and 3413 transitions. [2021-06-05 04:28:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:28:34,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:34,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:34,192 INFO L225 Difference]: With dead ends: 1043 [2021-06-05 04:28:34,192 INFO L226 Difference]: Without dead ends: 951 [2021-06-05 04:28:34,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 568.1ms TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-06-05 04:28:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 719. [2021-06-05 04:28:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 3.628133704735376) internal successors, (2605), 718 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 2605 transitions. [2021-06-05 04:28:34,208 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 2605 transitions. Word has length 18 [2021-06-05 04:28:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:34,209 INFO L482 AbstractCegarLoop]: Abstraction has 719 states and 2605 transitions. [2021-06-05 04:28:34,209 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 2605 transitions. [2021-06-05 04:28:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:34,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:34,210 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:34,431 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3097 [2021-06-05 04:28:34,432 INFO L430 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1742014878, now seen corresponding path program 132 times [2021-06-05 04:28:34,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:34,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484198336] [2021-06-05 04:28:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:34,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:34,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484198336] [2021-06-05 04:28:34,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484198336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:34,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930552078] [2021-06-05 04:28:34,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:34,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:28:34,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:34,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:34,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:34,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:34,804 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:34,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:34,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:34,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:34,825 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:34,825 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 04:28:34,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:34,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:34,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:34,928 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:34,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:34,928 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:28:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:34,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930552078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:34,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:34,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:28:34,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914857670] [2021-06-05 04:28:34,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:28:34,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:28:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:28:34,955 INFO L87 Difference]: Start difference. First operand 719 states and 2605 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:35,618 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-05 04:28:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:35,664 INFO L93 Difference]: Finished difference Result 816 states and 2879 transitions. [2021-06-05 04:28:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:35,665 INFO L225 Difference]: With dead ends: 816 [2021-06-05 04:28:35,665 INFO L226 Difference]: Without dead ends: 811 [2021-06-05 04:28:35,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 768.6ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:28:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-06-05 04:28:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 729. [2021-06-05 04:28:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.6263736263736264) internal successors, (2640), 728 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2640 transitions. [2021-06-05 04:28:35,673 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2640 transitions. Word has length 18 [2021-06-05 04:28:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:35,673 INFO L482 AbstractCegarLoop]: Abstraction has 729 states and 2640 transitions. [2021-06-05 04:28:35,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2640 transitions. [2021-06-05 04:28:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:35,674 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:35,674 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:35,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3105,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:35,875 INFO L430 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -885518932, now seen corresponding path program 133 times [2021-06-05 04:28:35,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:35,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742159956] [2021-06-05 04:28:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:36,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:36,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742159956] [2021-06-05 04:28:36,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742159956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:36,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76943072] [2021-06-05 04:28:36,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:36,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:36,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:36,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:36,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:36,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:36,259 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:36,277 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:36,277 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 04:28:36,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:36,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:36,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:36,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:36,403 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:36,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:36,407 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:36,409 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:36,446 INFO L628 ElimStorePlain]: treesize reduction 71, result has 39.3 percent of original size [2021-06-05 04:28:36,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:36,449 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:36,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:36,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:36,465 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 04:28:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:36,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76943072] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:36,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:36,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:28:36,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274065133] [2021-06-05 04:28:36,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:28:36,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:28:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:36,525 INFO L87 Difference]: Start difference. First operand 729 states and 2640 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:37,188 INFO L93 Difference]: Finished difference Result 842 states and 2944 transitions. [2021-06-05 04:28:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:28:37,188 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:37,189 INFO L225 Difference]: With dead ends: 842 [2021-06-05 04:28:37,189 INFO L226 Difference]: Without dead ends: 824 [2021-06-05 04:28:37,190 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 783.0ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:28:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-06-05 04:28:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 732. [2021-06-05 04:28:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 04:28:37,198 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 04:28:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:37,198 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 04:28:37,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 04:28:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:37,199 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:37,199 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:37,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3112,280 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:37,399 INFO L430 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash 603886064, now seen corresponding path program 134 times [2021-06-05 04:28:37,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:37,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910351570] [2021-06-05 04:28:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:37,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:37,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910351570] [2021-06-05 04:28:37,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910351570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:37,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628458457] [2021-06-05 04:28:37,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:37,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:37,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:37,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:37,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:37,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:37,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:37,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:37,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:37,739 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:37,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:37,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:37,767 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:28:37,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:37,864 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:37,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:28:37,867 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:37,882 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:28:37,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:37,886 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:37,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:37,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:37,894 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:28:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:37,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628458457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:37,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:37,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:37,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213970992] [2021-06-05 04:28:37,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:37,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:37,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:37,925 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:38,351 INFO L93 Difference]: Finished difference Result 784 states and 2793 transitions. [2021-06-05 04:28:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:38,352 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:38,353 INFO L225 Difference]: With dead ends: 784 [2021-06-05 04:28:38,353 INFO L226 Difference]: Without dead ends: 779 [2021-06-05 04:28:38,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 477.5ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:28:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-06-05 04:28:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 738. [2021-06-05 04:28:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.622795115332429) internal successors, (2670), 737 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2670 transitions. [2021-06-05 04:28:38,361 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2670 transitions. Word has length 18 [2021-06-05 04:28:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:38,361 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2670 transitions. [2021-06-05 04:28:38,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2670 transitions. [2021-06-05 04:28:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:38,362 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:38,362 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:38,562 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 281 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3122 [2021-06-05 04:28:38,563 INFO L430 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1336102682, now seen corresponding path program 135 times [2021-06-05 04:28:38,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:38,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011287817] [2021-06-05 04:28:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:38,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:38,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011287817] [2021-06-05 04:28:38,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011287817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:38,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632323] [2021-06-05 04:28:38,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:38,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:28:38,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:38,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:38,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:38,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:38,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:38,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:38,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:38,916 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:38,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:38,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:38,938 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:28:38,987 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_833, array_2], 1=[v_prenex_834, array_4]} [2021-06-05 04:28:38,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:38,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:38,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:38,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:39,033 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 04:28:39,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:39,035 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:39,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:39,049 INFO L518 ElimStorePlain]: Eliminatee v_prenex_834 vanished before elimination [2021-06-05 04:28:39,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:39,052 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:39,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:39,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:39,066 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:28:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:39,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:39,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:39,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:39,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851651266] [2021-06-05 04:28:39,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:39,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:39,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:39,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:39,126 INFO L87 Difference]: Start difference. First operand 738 states and 2670 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:39,739 INFO L93 Difference]: Finished difference Result 794 states and 2825 transitions. [2021-06-05 04:28:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:39,741 INFO L225 Difference]: With dead ends: 794 [2021-06-05 04:28:39,741 INFO L226 Difference]: Without dead ends: 789 [2021-06-05 04:28:39,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 684.3ms TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:28:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-06-05 04:28:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 735. [2021-06-05 04:28:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 3.6212534059945503) internal successors, (2658), 734 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2658 transitions. [2021-06-05 04:28:39,749 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 2658 transitions. Word has length 18 [2021-06-05 04:28:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:39,749 INFO L482 AbstractCegarLoop]: Abstraction has 735 states and 2658 transitions. [2021-06-05 04:28:39,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 2658 transitions. [2021-06-05 04:28:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:39,750 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:39,750 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:39,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 282 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3132 [2021-06-05 04:28:39,950 INFO L430 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2085123934, now seen corresponding path program 136 times [2021-06-05 04:28:39,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:39,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641248182] [2021-06-05 04:28:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:40,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:40,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641248182] [2021-06-05 04:28:40,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641248182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:40,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964599601] [2021-06-05 04:28:40,233 INFO L93 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 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:40,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:40,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:40,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:40,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:40,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:40,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:40,375 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:40,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:40,394 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:28:40,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:40,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:40,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:40,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:40,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:40,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:40,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:40,468 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:40,511 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 04:28:40,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:40,514 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:40,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:40,528 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:40,528 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:28:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:40,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964599601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:40,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:40,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:40,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112064971] [2021-06-05 04:28:40,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:40,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:40,591 INFO L87 Difference]: Start difference. First operand 735 states and 2658 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:41,342 INFO L93 Difference]: Finished difference Result 792 states and 2824 transitions. [2021-06-05 04:28:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:41,344 INFO L225 Difference]: With dead ends: 792 [2021-06-05 04:28:41,344 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 04:28:41,344 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 819.4ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:28:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 04:28:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 732. [2021-06-05 04:28:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 04:28:41,352 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 04:28:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:41,352 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 04:28:41,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 04:28:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:41,353 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:41,353 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:41,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3143 [2021-06-05 04:28:41,554 INFO L430 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1063225658, now seen corresponding path program 137 times [2021-06-05 04:28:41,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:41,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788982509] [2021-06-05 04:28:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:41,805 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:41,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788982509] [2021-06-05 04:28:41,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788982509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:41,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620142094] [2021-06-05 04:28:41,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:41,831 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:41,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:41,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:41,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:41,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:41,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:41,884 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:41,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:41,888 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:41,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:41,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:41,891 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:41,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:41,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:41,937 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:159, output treesize:123 [2021-06-05 04:28:42,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:42,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:42,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:42,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:42,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:42,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:42,270 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:42,318 INFO L628 ElimStorePlain]: treesize reduction 73, result has 43.8 percent of original size [2021-06-05 04:28:42,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:42,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:28:42,321 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:42,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:42,336 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:42,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:42,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:42,340 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:42,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:42,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:42,356 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:144, output treesize:16 [2021-06-05 04:28:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:42,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620142094] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:42,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:42,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:28:42,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38285555] [2021-06-05 04:28:42,381 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:42,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:42,382 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:42,611 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-06-05 04:28:42,963 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 04:28:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:43,142 INFO L93 Difference]: Finished difference Result 902 states and 3109 transitions. [2021-06-05 04:28:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:43,144 INFO L225 Difference]: With dead ends: 902 [2021-06-05 04:28:43,144 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 04:28:43,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 856.5ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 04:28:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 742. [2021-06-05 04:28:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.6288798920377867) internal successors, (2689), 741 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2689 transitions. [2021-06-05 04:28:43,154 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2689 transitions. Word has length 18 [2021-06-05 04:28:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:43,154 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2689 transitions. [2021-06-05 04:28:43,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2689 transitions. [2021-06-05 04:28:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:43,155 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:43,155 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:43,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 284 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3153 [2021-06-05 04:28:43,356 INFO L430 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1919721604, now seen corresponding path program 138 times [2021-06-05 04:28:43,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:43,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949538362] [2021-06-05 04:28:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:43,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:43,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949538362] [2021-06-05 04:28:43,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949538362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:43,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062655677] [2021-06-05 04:28:43,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:43,618 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:28:43,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:43,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:43,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:43,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:43,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:43,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:43,672 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:43,676 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:43,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:43,717 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:43,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:43,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,984 INFO L628 ElimStorePlain]: treesize reduction 58, result has 41.4 percent of original size [2021-06-05 04:28:43,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:43,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:43,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:43,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:43,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:43,997 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:44,005 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:44,005 INFO L518 ElimStorePlain]: Eliminatee v_prenex_843 vanished before elimination [2021-06-05 04:28:44,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:44,006 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 04:28:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:44,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062655677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:44,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:44,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:28:44,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825815851] [2021-06-05 04:28:44,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:28:44,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:44,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:28:44,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:28:44,021 INFO L87 Difference]: Start difference. First operand 742 states and 2689 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:44,575 INFO L93 Difference]: Finished difference Result 896 states and 3107 transitions. [2021-06-05 04:28:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:44,577 INFO L225 Difference]: With dead ends: 896 [2021-06-05 04:28:44,577 INFO L226 Difference]: Without dead ends: 891 [2021-06-05 04:28:44,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 712.2ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:28:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-06-05 04:28:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 748. [2021-06-05 04:28:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6318607764390896) internal successors, (2713), 747 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2713 transitions. [2021-06-05 04:28:44,585 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2713 transitions. Word has length 18 [2021-06-05 04:28:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:44,586 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2713 transitions. [2021-06-05 04:28:44,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2713 transitions. [2021-06-05 04:28:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:44,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:44,587 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:44,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3174 [2021-06-05 04:28:44,787 INFO L430 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash -20267142, now seen corresponding path program 139 times [2021-06-05 04:28:44,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:44,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959261246] [2021-06-05 04:28:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:45,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:45,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959261246] [2021-06-05 04:28:45,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959261246] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:45,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690017394] [2021-06-05 04:28:45,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:45,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:45,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:45,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:45,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:45,098 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:45,101 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:45,104 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:45,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:45,143 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:45,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:45,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:45,313 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,360 INFO L628 ElimStorePlain]: treesize reduction 89, result has 40.3 percent of original size [2021-06-05 04:28:45,360 INFO L518 ElimStorePlain]: Eliminatee v_prenex_846 vanished before elimination [2021-06-05 04:28:45,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:45,363 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:45,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:45,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:45,383 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:45,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:45,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:45,400 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 04:28:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:45,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690017394] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:45,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:45,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:28:45,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662958719] [2021-06-05 04:28:45,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:28:45,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:28:45,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:28:45,453 INFO L87 Difference]: Start difference. First operand 748 states and 2713 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:46,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:46,022 INFO L93 Difference]: Finished difference Result 919 states and 3174 transitions. [2021-06-05 04:28:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:46,024 INFO L225 Difference]: With dead ends: 919 [2021-06-05 04:28:46,024 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 04:28:46,024 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 696.1ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:28:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 04:28:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 738. [2021-06-05 04:28:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.628222523744912) internal successors, (2674), 737 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2674 transitions. [2021-06-05 04:28:46,033 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2674 transitions. Word has length 18 [2021-06-05 04:28:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:46,033 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2674 transitions. [2021-06-05 04:28:46,033 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2674 transitions. [2021-06-05 04:28:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:46,034 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:46,034 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:46,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3191 [2021-06-05 04:28:46,234 INFO L430 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:46,235 INFO L82 PathProgramCache]: Analyzing trace with hash -446381756, now seen corresponding path program 140 times [2021-06-05 04:28:46,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:46,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035844660] [2021-06-05 04:28:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:46,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:46,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035844660] [2021-06-05 04:28:46,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035844660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:46,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740482972] [2021-06-05 04:28:46,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:46,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:46,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:46,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:46,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:46,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:46,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:46,550 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:46,553 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:46,555 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:46,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:46,583 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 04:28:46,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:46,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:46,824 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:46,828 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:46,831 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:46,880 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 04:28:46,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:46,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:46,884 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:46,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:46,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:46,903 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:28:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:46,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740482972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:46,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:46,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:28:46,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640111002] [2021-06-05 04:28:46,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:28:46,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:28:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:28:46,951 INFO L87 Difference]: Start difference. First operand 738 states and 2674 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:47,935 INFO L93 Difference]: Finished difference Result 928 states and 3191 transitions. [2021-06-05 04:28:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:28:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:47,937 INFO L225 Difference]: With dead ends: 928 [2021-06-05 04:28:47,937 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 04:28:47,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 945.4ms TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:28:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 04:28:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 740. [2021-06-05 04:28:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.6238159675236807) internal successors, (2678), 739 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2678 transitions. [2021-06-05 04:28:47,946 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2678 transitions. Word has length 18 [2021-06-05 04:28:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:47,946 INFO L482 AbstractCegarLoop]: Abstraction has 740 states and 2678 transitions. [2021-06-05 04:28:47,946 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2678 transitions. [2021-06-05 04:28:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:47,947 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:47,947 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:48,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3207,287 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:48,148 INFO L430 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:48,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2024323972, now seen corresponding path program 141 times [2021-06-05 04:28:48,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:48,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943332771] [2021-06-05 04:28:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:48,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:48,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943332771] [2021-06-05 04:28:48,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943332771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:48,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532122176] [2021-06-05 04:28:48,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:48,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:28:48,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:48,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 04:28:48,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:48,705 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:48,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:28:48,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,713 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:48,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:28:48,714 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,720 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:48,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 04:28:48,721 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,734 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:48,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 04:28:48,736 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,742 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:28:48,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 04:28:48,743 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,747 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:48,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 04:28:48,748 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,807 INFO L628 ElimStorePlain]: treesize reduction 97, result has 50.5 percent of original size [2021-06-05 04:28:48,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:28:48,808 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:298, output treesize:95 [2021-06-05 04:28:48,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:48,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:48,882 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:48,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:48,886 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:48,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:48,890 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:48,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:48,893 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:48,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:48,897 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:48,901 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:48,965 INFO L628 ElimStorePlain]: treesize reduction 128, result has 38.2 percent of original size [2021-06-05 04:28:48,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:48,968 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:48,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:48,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:28:48,995 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:255, output treesize:71 [2021-06-05 04:28:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:49,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532122176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:49,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:49,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:28:49,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128867881] [2021-06-05 04:28:49,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:49,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:49,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:49,069 INFO L87 Difference]: Start difference. First operand 740 states and 2678 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:49,537 INFO L93 Difference]: Finished difference Result 813 states and 2847 transitions. [2021-06-05 04:28:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:49,538 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:49,539 INFO L225 Difference]: With dead ends: 813 [2021-06-05 04:28:49,539 INFO L226 Difference]: Without dead ends: 800 [2021-06-05 04:28:49,539 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 722.5ms TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:28:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-06-05 04:28:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 741. [2021-06-05 04:28:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.6202702702702703) internal successors, (2679), 740 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2679 transitions. [2021-06-05 04:28:49,548 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2679 transitions. Word has length 18 [2021-06-05 04:28:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:49,548 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2679 transitions. [2021-06-05 04:28:49,548 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2679 transitions. [2021-06-05 04:28:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:49,549 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:49,549 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:49,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3224,288 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:49,750 INFO L430 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1165319792, now seen corresponding path program 142 times [2021-06-05 04:28:49,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:49,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255116427] [2021-06-05 04:28:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:50,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:50,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255116427] [2021-06-05 04:28:50,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255116427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:50,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870389030] [2021-06-05 04:28:50,016 INFO L93 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 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:50,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:50,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:50,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:50,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:50,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:50,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:50,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:50,095 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:50,098 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:50,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:50,137 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:28:50,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:50,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:50,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,483 INFO L628 ElimStorePlain]: treesize reduction 54, result has 40.0 percent of original size [2021-06-05 04:28:50,483 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:28:50,483 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:28:50,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:50,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:28:50,487 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:50,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:50,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:50,498 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 04:28:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:50,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870389030] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:50,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:50,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:28:50,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603393770] [2021-06-05 04:28:50,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:28:50,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:28:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:28:50,520 INFO L87 Difference]: Start difference. First operand 741 states and 2679 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:50,736 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2021-06-05 04:28:50,924 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 04:28:51,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:51,127 INFO L93 Difference]: Finished difference Result 825 states and 2888 transitions. [2021-06-05 04:28:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:51,129 INFO L225 Difference]: With dead ends: 825 [2021-06-05 04:28:51,129 INFO L226 Difference]: Without dead ends: 820 [2021-06-05 04:28:51,129 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 849.1ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-06-05 04:28:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 748. [2021-06-05 04:28:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6238286479250337) internal successors, (2707), 747 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2707 transitions. [2021-06-05 04:28:51,137 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2707 transitions. Word has length 18 [2021-06-05 04:28:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:51,137 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2707 transitions. [2021-06-05 04:28:51,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2707 transitions. [2021-06-05 04:28:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:51,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:51,138 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:51,339 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 289 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3242 [2021-06-05 04:28:51,339 INFO L430 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash -774668954, now seen corresponding path program 143 times [2021-06-05 04:28:51,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:51,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764415951] [2021-06-05 04:28:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:51,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:51,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764415951] [2021-06-05 04:28:51,649 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764415951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:51,649 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722706955] [2021-06-05 04:28:51,649 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:51,682 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:51,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:51,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:51,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:51,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:51,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:51,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:51,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:51,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:28:51,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:51,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:51,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:51,771 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:51,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:28:51,774 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:51,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:51,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:28:51,819 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 04:28:52,042 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_856, array_2], 1=[v_prenex_857, array_4]} [2021-06-05 04:28:52,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:52,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:52,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:52,050 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:52,100 INFO L628 ElimStorePlain]: treesize reduction 79, result has 38.8 percent of original size [2021-06-05 04:28:52,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:28:52,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:52,121 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:52,121 INFO L518 ElimStorePlain]: Eliminatee v_prenex_857 vanished before elimination [2021-06-05 04:28:52,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:52,125 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:52,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:52,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:52,143 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:28:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:52,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722706955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:52,205 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:52,205 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:52,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375389496] [2021-06-05 04:28:52,205 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:52,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:52,205 INFO L87 Difference]: Start difference. First operand 748 states and 2707 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:52,660 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2021-06-05 04:28:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:52,879 INFO L93 Difference]: Finished difference Result 852 states and 2963 transitions. [2021-06-05 04:28:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:52,881 INFO L225 Difference]: With dead ends: 852 [2021-06-05 04:28:52,881 INFO L226 Difference]: Without dead ends: 847 [2021-06-05 04:28:52,881 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 889.6ms TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:28:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-06-05 04:28:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 742. [2021-06-05 04:28:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 04:28:52,890 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 04:28:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:52,890 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 04:28:52,890 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 04:28:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:52,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:52,891 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:53,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3258 [2021-06-05 04:28:53,091 INFO L430 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 423886118, now seen corresponding path program 144 times [2021-06-05 04:28:53,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:53,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038871834] [2021-06-05 04:28:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:53,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:53,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038871834] [2021-06-05 04:28:53,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038871834] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:53,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758423277] [2021-06-05 04:28:53,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:53,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:28:53,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:53,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 04:28:53,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:53,651 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:53,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:28:53,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,657 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:53,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 04:28:53,658 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,662 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:28:53,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 04:28:53,663 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,669 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:28:53,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 04:28:53,670 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,716 INFO L628 ElimStorePlain]: treesize reduction 33, result has 70.5 percent of original size [2021-06-05 04:28:53,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:28:53,717 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:180, output treesize:75 [2021-06-05 04:28:53,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:53,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:53,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:53,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:53,788 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:53,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:53,791 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:53,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:28:53,795 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:53,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:53,798 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:53,801 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:53,853 INFO L628 ElimStorePlain]: treesize reduction 112, result has 36.0 percent of original size [2021-06-05 04:28:53,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:53,856 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:53,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:53,877 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:28:53,877 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:215, output treesize:55 [2021-06-05 04:28:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:53,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758423277] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:53,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:53,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:28:53,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322369937] [2021-06-05 04:28:53,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:28:53,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:28:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:28:53,955 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:54,489 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 04:28:54,705 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2021-06-05 04:28:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:55,121 INFO L93 Difference]: Finished difference Result 841 states and 2938 transitions. [2021-06-05 04:28:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:28:55,121 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:55,122 INFO L225 Difference]: With dead ends: 841 [2021-06-05 04:28:55,122 INFO L226 Difference]: Without dead ends: 836 [2021-06-05 04:28:55,123 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1248.0ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:28:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-06-05 04:28:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 742. [2021-06-05 04:28:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 04:28:55,131 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 04:28:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:55,131 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 04:28:55,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 04:28:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:55,132 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:55,132 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:55,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3272,291 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:55,333 INFO L430 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1307733628, now seen corresponding path program 145 times [2021-06-05 04:28:55,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:55,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115147865] [2021-06-05 04:28:55,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:55,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:55,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115147865] [2021-06-05 04:28:55,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115147865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:55,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521881029] [2021-06-05 04:28:55,546 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:55,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:55,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:55,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:55,701 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:55,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:55,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:55,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:55,740 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:55,741 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 04:28:55,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:55,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:55,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:55,935 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:55,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:55,940 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:55,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:55,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:55,944 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:56,013 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 04:28:56,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:56,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:56,018 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:56,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:56,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:56,044 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:44 [2021-06-05 04:28:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:56,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521881029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:56,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:56,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:28:56,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450566438] [2021-06-05 04:28:56,113 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:56,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:56,113 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:56,449 INFO L93 Difference]: Finished difference Result 781 states and 2780 transitions. [2021-06-05 04:28:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:56,451 INFO L225 Difference]: With dead ends: 781 [2021-06-05 04:28:56,451 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 04:28:56,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 524.7ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:28:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 04:28:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 04:28:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 04:28:56,459 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 04:28:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:56,459 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 04:28:56,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 04:28:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:56,460 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:56,460 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:56,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 292 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3291 [2021-06-05 04:28:56,660 INFO L430 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1047244922, now seen corresponding path program 146 times [2021-06-05 04:28:56,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:56,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338280845] [2021-06-05 04:28:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:56,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:56,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338280845] [2021-06-05 04:28:56,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338280845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:56,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386741195] [2021-06-05 04:28:56,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:56,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:28:56,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:56,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:56,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:57,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:57,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:57,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:57,010 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:57,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:57,042 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:57,042 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 04:28:57,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:57,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:57,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:57,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:57,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:28:57,119 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:57,177 INFO L628 ElimStorePlain]: treesize reduction 91, result has 38.1 percent of original size [2021-06-05 04:28:57,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:57,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:57,182 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:57,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:57,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:28:57,208 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:57,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:57,229 INFO L518 ElimStorePlain]: Eliminatee v_prenex_863 vanished before elimination [2021-06-05 04:28:57,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:57,230 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 04:28:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:57,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386741195] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:57,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:57,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:28:57,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364209260] [2021-06-05 04:28:57,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:28:57,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:28:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:28:57,290 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:57,595 INFO L93 Difference]: Finished difference Result 783 states and 2797 transitions. [2021-06-05 04:28:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:28:57,595 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:57,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:57,596 INFO L225 Difference]: With dead ends: 783 [2021-06-05 04:28:57,596 INFO L226 Difference]: Without dead ends: 778 [2021-06-05 04:28:57,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 401.5ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-06-05 04:28:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 745. [2021-06-05 04:28:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 3.618279569892473) internal successors, (2692), 744 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2692 transitions. [2021-06-05 04:28:57,605 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2692 transitions. Word has length 18 [2021-06-05 04:28:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:57,605 INFO L482 AbstractCegarLoop]: Abstraction has 745 states and 2692 transitions. [2021-06-05 04:28:57,605 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2692 transitions. [2021-06-05 04:28:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:57,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:57,606 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:57,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3303,293 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:57,806 INFO L430 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 173504242, now seen corresponding path program 147 times [2021-06-05 04:28:57,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:57,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909366311] [2021-06-05 04:28:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:58,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:58,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909366311] [2021-06-05 04:28:58,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909366311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:58,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442736313] [2021-06-05 04:28:58,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:58,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:28:58,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:58,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:28:58,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:58,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:58,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:58,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:58,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:58,284 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:58,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:28:58,287 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 04:28:58,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:58,447 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:58,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:58,452 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:58,541 INFO L628 ElimStorePlain]: treesize reduction 111, result has 42.5 percent of original size [2021-06-05 04:28:58,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:28:58,545 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:58,569 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:58,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:58,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:28:58,573 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:28:58,596 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:58,596 INFO L518 ElimStorePlain]: Eliminatee v_prenex_865 vanished before elimination [2021-06-05 04:28:58,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:28:58,597 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:207, output treesize:35 [2021-06-05 04:28:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:58,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442736313] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:58,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:28:58,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 04:28:58,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811810847] [2021-06-05 04:28:58,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:28:58,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:28:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:28:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:28:58,650 INFO L87 Difference]: Start difference. First operand 745 states and 2692 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:28:59,274 INFO L93 Difference]: Finished difference Result 796 states and 2822 transitions. [2021-06-05 04:28:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:28:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:28:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:28:59,276 INFO L225 Difference]: With dead ends: 796 [2021-06-05 04:28:59,276 INFO L226 Difference]: Without dead ends: 791 [2021-06-05 04:28:59,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 674.1ms TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:28:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-06-05 04:28:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 748. [2021-06-05 04:28:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6198125836680055) internal successors, (2704), 747 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2704 transitions. [2021-06-05 04:28:59,287 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2704 transitions. Word has length 18 [2021-06-05 04:28:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:28:59,287 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2704 transitions. [2021-06-05 04:28:59,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:28:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2704 transitions. [2021-06-05 04:28:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:28:59,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:28:59,288 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:28:59,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3313,294 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:59,505 INFO L430 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:28:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:28:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1497471774, now seen corresponding path program 148 times [2021-06-05 04:28:59,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:28:59,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620107583] [2021-06-05 04:28:59,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:28:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:28:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:28:59,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:28:59,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620107583] [2021-06-05 04:28:59,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620107583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:28:59,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79496111] [2021-06-05 04:28:59,772 INFO L93 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 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:28:59,798 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:28:59,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:28:59,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:28:59,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:28:59,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:59,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:59,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:28:59,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:59,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:28:59,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:28:59,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:28:59,965 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:28:59,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:28:59,967 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:99 [2021-06-05 04:29:00,125 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 04:29:00,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:00,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:00,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:00,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:00,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:00,139 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:00,143 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:00,205 INFO L628 ElimStorePlain]: treesize reduction 96, result has 44.5 percent of original size [2021-06-05 04:29:00,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:00,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:00,208 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:00,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:00,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:00,231 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:207, output treesize:78 [2021-06-05 04:29:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:00,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79496111] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:00,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:00,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 04:29:00,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363340577] [2021-06-05 04:29:00,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:29:00,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:29:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:29:00,319 INFO L87 Difference]: Start difference. First operand 748 states and 2704 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:00,601 INFO L93 Difference]: Finished difference Result 779 states and 2776 transitions. [2021-06-05 04:29:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:00,601 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:00,603 INFO L225 Difference]: With dead ends: 779 [2021-06-05 04:29:00,603 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 04:29:00,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 498.1ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 04:29:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 04:29:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 04:29:00,610 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 04:29:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:00,611 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 04:29:00,611 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 04:29:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:00,611 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:00,612 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:00,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3340,295 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:00,812 INFO L430 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 722420652, now seen corresponding path program 149 times [2021-06-05 04:29:00,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:00,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445961830] [2021-06-05 04:29:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:01,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:01,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445961830] [2021-06-05 04:29:01,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445961830] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:01,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449927487] [2021-06-05 04:29:01,123 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:01,150 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:01,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:01,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:01,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:01,227 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:01,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:01,231 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:01,235 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:01,238 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:01,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:01,299 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:143 [2021-06-05 04:29:01,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:29:01,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:01,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,556 INFO L628 ElimStorePlain]: treesize reduction 63, result has 41.7 percent of original size [2021-06-05 04:29:01,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:01,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:01,559 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:01,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:01,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:01,573 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:01,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:01,583 INFO L518 ElimStorePlain]: Eliminatee v_prenex_872 vanished before elimination [2021-06-05 04:29:01,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:01,584 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:122, output treesize:16 [2021-06-05 04:29:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:01,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449927487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:01,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:01,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 04:29:01,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962657886] [2021-06-05 04:29:01,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:29:01,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:29:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:29:01,611 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:01,896 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 04:29:02,181 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2021-06-05 04:29:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:02,275 INFO L93 Difference]: Finished difference Result 792 states and 2815 transitions. [2021-06-05 04:29:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:02,276 INFO L225 Difference]: With dead ends: 792 [2021-06-05 04:29:02,276 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 04:29:02,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 898.4ms TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:29:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 04:29:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 754. [2021-06-05 04:29:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 3.6188579017264275) internal successors, (2725), 753 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2725 transitions. [2021-06-05 04:29:02,284 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2725 transitions. Word has length 18 [2021-06-05 04:29:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:02,284 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 2725 transitions. [2021-06-05 04:29:02,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2725 transitions. [2021-06-05 04:29:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:02,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:02,285 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:02,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3368,296 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:02,486 INFO L430 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1217568094, now seen corresponding path program 150 times [2021-06-05 04:29:02,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:02,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32000794] [2021-06-05 04:29:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:02,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:02,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32000794] [2021-06-05 04:29:02,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32000794] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:02,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340977271] [2021-06-05 04:29:02,741 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:02,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:29:02,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:02,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:02,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:02,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:02,840 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:02,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:02,843 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:02,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:02,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:02,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:02,850 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:02,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:02,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:02,891 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 04:29:03,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:03,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:03,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:03,080 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:03,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:03,084 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:03,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:03,088 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:03,139 INFO L628 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2021-06-05 04:29:03,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:03,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:03,142 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:03,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:03,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:03,161 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 04:29:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:03,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340977271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:03,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:03,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:03,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959782336] [2021-06-05 04:29:03,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:03,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:03,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:03,212 INFO L87 Difference]: Start difference. First operand 754 states and 2725 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:03,460 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-06-05 04:29:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:03,816 INFO L93 Difference]: Finished difference Result 812 states and 2883 transitions. [2021-06-05 04:29:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:03,818 INFO L225 Difference]: With dead ends: 812 [2021-06-05 04:29:03,818 INFO L226 Difference]: Without dead ends: 807 [2021-06-05 04:29:03,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 724.3ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-06-05 04:29:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 747. [2021-06-05 04:29:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.6152815013404824) internal successors, (2697), 746 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2697 transitions. [2021-06-05 04:29:03,826 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2697 transitions. Word has length 18 [2021-06-05 04:29:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:03,826 INFO L482 AbstractCegarLoop]: Abstraction has 747 states and 2697 transitions. [2021-06-05 04:29:03,826 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2697 transitions. [2021-06-05 04:29:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:03,827 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:03,827 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:04,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3385 [2021-06-05 04:29:04,028 INFO L430 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 929513634, now seen corresponding path program 151 times [2021-06-05 04:29:04,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:04,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231487442] [2021-06-05 04:29:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:04,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:04,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231487442] [2021-06-05 04:29:04,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231487442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:04,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694237504] [2021-06-05 04:29:04,311 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:04,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:04,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:04,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:04,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:04,429 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:04,432 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:04,435 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,469 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:04,470 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:04,470 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 04:29:04,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:04,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:04,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:04,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:04,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:04,588 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,625 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:29:04,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:04,628 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:04,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:04,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:04,642 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:29:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:04,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694237504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:04,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:04,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:04,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000468284] [2021-06-05 04:29:04,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:04,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:04,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:04,705 INFO L87 Difference]: Start difference. First operand 747 states and 2697 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:05,102 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-06-05 04:29:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:05,522 INFO L93 Difference]: Finished difference Result 795 states and 2837 transitions. [2021-06-05 04:29:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:29:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:05,524 INFO L225 Difference]: With dead ends: 795 [2021-06-05 04:29:05,524 INFO L226 Difference]: Without dead ends: 790 [2021-06-05 04:29:05,524 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 958.1ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-06-05 04:29:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 748. [2021-06-05 04:29:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6131191432396252) internal successors, (2699), 747 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2699 transitions. [2021-06-05 04:29:05,532 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2699 transitions. Word has length 18 [2021-06-05 04:29:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:05,532 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2699 transitions. [2021-06-05 04:29:05,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2699 transitions. [2021-06-05 04:29:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:05,533 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:05,533 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:05,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3400,298 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:05,733 INFO L430 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1966146404, now seen corresponding path program 152 times [2021-06-05 04:29:05,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:05,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937872872] [2021-06-05 04:29:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:05,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:05,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937872872] [2021-06-05 04:29:05,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937872872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:05,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428012694] [2021-06-05 04:29:05,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:05,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:05,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:05,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:05,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:05,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:05,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:05,866 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:05,869 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:05,872 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:05,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:05,895 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 04:29:05,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:05,993 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:05,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:05,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:05,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:05,998 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:06,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:06,002 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:06,030 INFO L628 ElimStorePlain]: treesize reduction 60, result has 31.0 percent of original size [2021-06-05 04:29:06,031 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:06,031 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:06,031 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:27 [2021-06-05 04:29:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:06,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428012694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:06,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:06,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:29:06,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600505690] [2021-06-05 04:29:06,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:06,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:06,059 INFO L87 Difference]: Start difference. First operand 748 states and 2699 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:06,972 INFO L93 Difference]: Finished difference Result 1086 states and 3629 transitions. [2021-06-05 04:29:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 04:29:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:06,974 INFO L225 Difference]: With dead ends: 1086 [2021-06-05 04:29:06,974 INFO L226 Difference]: Without dead ends: 963 [2021-06-05 04:29:06,974 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 799.8ms TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:29:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-06-05 04:29:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 781. [2021-06-05 04:29:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 3.693589743589744) internal successors, (2881), 780 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 2881 transitions. [2021-06-05 04:29:06,984 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 2881 transitions. Word has length 18 [2021-06-05 04:29:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:06,984 INFO L482 AbstractCegarLoop]: Abstraction has 781 states and 2881 transitions. [2021-06-05 04:29:06,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 2881 transitions. [2021-06-05 04:29:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:06,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:06,985 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:07,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3415,299 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:07,186 INFO L430 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1651169188, now seen corresponding path program 153 times [2021-06-05 04:29:07,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:07,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610175208] [2021-06-05 04:29:07,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:07,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:07,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610175208] [2021-06-05 04:29:07,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610175208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:07,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712196201] [2021-06-05 04:29:07,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:07,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:07,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:07,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:07,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:07,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:07,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:07,342 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:07,345 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:07,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:07,360 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:07,371 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:07,371 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2021-06-05 04:29:07,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:07,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:07,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:07,410 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:07,412 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,414 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:07,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:07,427 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,429 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:07,429 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,432 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:07,432 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:07,435 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:07,466 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 04:29:07,466 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:07,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:07,467 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 04:29:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:07,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712196201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:07,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:07,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:29:07,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135546289] [2021-06-05 04:29:07,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:07,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:07,504 INFO L87 Difference]: Start difference. First operand 781 states and 2881 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:08,158 INFO L93 Difference]: Finished difference Result 1046 states and 3567 transitions. [2021-06-05 04:29:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 04:29:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:08,159 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 04:29:08,160 INFO L226 Difference]: Without dead ends: 980 [2021-06-05 04:29:08,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 478.4ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:29:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-06-05 04:29:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 829. [2021-06-05 04:29:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.6642512077294684) internal successors, (3034), 828 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 3034 transitions. [2021-06-05 04:29:08,170 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 3034 transitions. Word has length 18 [2021-06-05 04:29:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:08,170 INFO L482 AbstractCegarLoop]: Abstraction has 829 states and 3034 transitions. [2021-06-05 04:29:08,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 3034 transitions. [2021-06-05 04:29:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:08,171 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:08,171 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:08,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 300 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3426 [2021-06-05 04:29:08,371 INFO L430 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 555703338, now seen corresponding path program 154 times [2021-06-05 04:29:08,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:08,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011123189] [2021-06-05 04:29:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:08,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:08,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011123189] [2021-06-05 04:29:08,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011123189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:08,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127098710] [2021-06-05 04:29:08,853 INFO L93 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 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:08,880 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:29:08,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:08,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:29:08,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:09,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:09,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:09,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:09,033 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:09,037 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:09,043 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:09,048 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:09,054 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:09,060 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:09,064 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:09,068 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,198 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2021-06-05 04:29:09,198 INFO L628 ElimStorePlain]: treesize reduction 124, result has 58.5 percent of original size [2021-06-05 04:29:09,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:29:09,200 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:385, output treesize:175 [2021-06-05 04:29:09,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:09,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:09,339 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:09,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:09,342 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:09,345 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,383 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.9 percent of original size [2021-06-05 04:29:09,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:09,385 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:09,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:09,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:09,400 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 04:29:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:09,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127098710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:09,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:09,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:29:09,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099529983] [2021-06-05 04:29:09,464 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:09,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:09,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:09,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:09,464 INFO L87 Difference]: Start difference. First operand 829 states and 3034 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:10,147 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-06-05 04:29:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:10,274 INFO L93 Difference]: Finished difference Result 858 states and 3091 transitions. [2021-06-05 04:29:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:10,275 INFO L225 Difference]: With dead ends: 858 [2021-06-05 04:29:10,275 INFO L226 Difference]: Without dead ends: 844 [2021-06-05 04:29:10,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1265.7ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-06-05 04:29:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 826. [2021-06-05 04:29:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.667878787878788) internal successors, (3026), 825 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 3026 transitions. [2021-06-05 04:29:10,284 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 3026 transitions. Word has length 18 [2021-06-05 04:29:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:10,284 INFO L482 AbstractCegarLoop]: Abstraction has 826 states and 3026 transitions. [2021-06-05 04:29:10,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 3026 transitions. [2021-06-05 04:29:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:10,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:10,285 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:10,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3436,301 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:10,486 INFO L430 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash -623377692, now seen corresponding path program 155 times [2021-06-05 04:29:10,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:10,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949871353] [2021-06-05 04:29:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:10,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:10,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949871353] [2021-06-05 04:29:10,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949871353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:10,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309077289] [2021-06-05 04:29:10,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:10,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:29:10,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:10,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:29:10,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:10,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:10,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:10,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:10,615 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:10,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:10,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:29:10,629 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:10,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:10,640 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:10,640 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:29:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:10,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309077289] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:10,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:10,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 04:29:10,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233024303] [2021-06-05 04:29:10,697 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 04:29:10,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 04:29:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 04:29:10,697 INFO L87 Difference]: Start difference. First operand 826 states and 3026 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:11,067 INFO L93 Difference]: Finished difference Result 1161 states and 3992 transitions. [2021-06-05 04:29:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:29:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:11,069 INFO L225 Difference]: With dead ends: 1161 [2021-06-05 04:29:11,069 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 04:29:11,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 329.9ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:29:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 04:29:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 856. [2021-06-05 04:29:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 3.709941520467836) internal successors, (3172), 855 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 3172 transitions. [2021-06-05 04:29:11,082 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 3172 transitions. Word has length 18 [2021-06-05 04:29:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:11,082 INFO L482 AbstractCegarLoop]: Abstraction has 856 states and 3172 transitions. [2021-06-05 04:29:11,082 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 3172 transitions. [2021-06-05 04:29:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:11,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:11,083 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:11,283 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 302 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3450 [2021-06-05 04:29:11,284 INFO L430 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -869997864, now seen corresponding path program 156 times [2021-06-05 04:29:11,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:11,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144274407] [2021-06-05 04:29:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:11,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:11,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144274407] [2021-06-05 04:29:11,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144274407] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:11,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812923991] [2021-06-05 04:29:11,331 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:11,357 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:29:11,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:11,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:29:11,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:11,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:11,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:11,440 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,441 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:11,442 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:11,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:11,445 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:11,448 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:11,451 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,452 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:11,453 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,485 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 04:29:11,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:11,486 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 04:29:11,521 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_877, array_0, array_2], 1=[v_prenex_878]} [2021-06-05 04:29:11,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:11,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:11,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:11,552 INFO L628 ElimStorePlain]: treesize reduction 33, result has 52.2 percent of original size [2021-06-05 04:29:11,552 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 04:29:11,552 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:29:11,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:29:11,555 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:11,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:11,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:11,566 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:83, output treesize:30 [2021-06-05 04:29:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:11,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812923991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:11,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:11,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:29:11,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730671613] [2021-06-05 04:29:11,599 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:11,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:11,599 INFO L87 Difference]: Start difference. First operand 856 states and 3172 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:12,355 INFO L93 Difference]: Finished difference Result 1058 states and 3660 transitions. [2021-06-05 04:29:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 04:29:12,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:12,357 INFO L225 Difference]: With dead ends: 1058 [2021-06-05 04:29:12,357 INFO L226 Difference]: Without dead ends: 996 [2021-06-05 04:29:12,357 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 570.5ms TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-06-05 04:29:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-06-05 04:29:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 834. [2021-06-05 04:29:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.6614645858343335) internal successors, (3050), 833 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 3050 transitions. [2021-06-05 04:29:12,369 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 3050 transitions. Word has length 18 [2021-06-05 04:29:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:12,369 INFO L482 AbstractCegarLoop]: Abstraction has 834 states and 3050 transitions. [2021-06-05 04:29:12,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 3050 transitions. [2021-06-05 04:29:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:12,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:12,370 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:12,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3457,303 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:12,585 INFO L430 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -696750172, now seen corresponding path program 157 times [2021-06-05 04:29:12,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:12,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911718545] [2021-06-05 04:29:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:29:12,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:12,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911718545] [2021-06-05 04:29:12,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911718545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:12,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806404568] [2021-06-05 04:29:12,632 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:12,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:29:12,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:12,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:12,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:12,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:12,741 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:12,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:12,744 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:12,746 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:12,749 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,751 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:12,751 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,783 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 04:29:12,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:12,784 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 04:29:12,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:12,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:12,840 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 04:29:12,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:29:12,842 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:12,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:12,843 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:12,843 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 04:29:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:12,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806404568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:12,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:12,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:29:12,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192308022] [2021-06-05 04:29:12,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:12,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:12,851 INFO L87 Difference]: Start difference. First operand 834 states and 3050 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:13,872 INFO L93 Difference]: Finished difference Result 1132 states and 3930 transitions. [2021-06-05 04:29:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 04:29:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:13,874 INFO L225 Difference]: With dead ends: 1132 [2021-06-05 04:29:13,874 INFO L226 Difference]: Without dead ends: 1078 [2021-06-05 04:29:13,874 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 745.8ms TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 04:29:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-06-05 04:29:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 837. [2021-06-05 04:29:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 3.648325358851675) internal successors, (3050), 836 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 3050 transitions. [2021-06-05 04:29:13,884 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 3050 transitions. Word has length 18 [2021-06-05 04:29:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:13,884 INFO L482 AbstractCegarLoop]: Abstraction has 837 states and 3050 transitions. [2021-06-05 04:29:13,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 3050 transitions. [2021-06-05 04:29:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:13,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:13,886 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:14,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3467,304 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:14,087 INFO L430 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:14,087 INFO L82 PathProgramCache]: Analyzing trace with hash -565449940, now seen corresponding path program 158 times [2021-06-05 04:29:14,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:14,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213867762] [2021-06-05 04:29:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:14,497 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 04:29:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:14,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:14,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213867762] [2021-06-05 04:29:14,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213867762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:14,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759542298] [2021-06-05 04:29:14,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:14,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:14,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:14,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:14,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:14,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:14,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:14,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:14,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:14,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:14,912 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:14,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:14,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:14,916 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:14,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:14,919 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:14,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:14,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:14,964 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:29:15,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:15,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:15,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:29:15,126 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:15,139 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:29:15,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:15,141 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:15,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:15,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:15,147 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:29:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:15,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759542298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:15,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:15,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:15,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985327516] [2021-06-05 04:29:15,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:15,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:15,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:15,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:15,177 INFO L87 Difference]: Start difference. First operand 837 states and 3050 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:15,868 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 04:29:16,227 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2021-06-05 04:29:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:16,370 INFO L93 Difference]: Finished difference Result 932 states and 3319 transitions. [2021-06-05 04:29:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:29:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:16,373 INFO L225 Difference]: With dead ends: 932 [2021-06-05 04:29:16,373 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 04:29:16,373 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1538.8ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:29:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 04:29:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 841. [2021-06-05 04:29:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.645238095238095) internal successors, (3062), 840 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 3062 transitions. [2021-06-05 04:29:16,385 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 3062 transitions. Word has length 18 [2021-06-05 04:29:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:16,385 INFO L482 AbstractCegarLoop]: Abstraction has 841 states and 3062 transitions. [2021-06-05 04:29:16,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 3062 transitions. [2021-06-05 04:29:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:16,386 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:16,386 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:16,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 305 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3477 [2021-06-05 04:29:16,587 INFO L430 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 733291496, now seen corresponding path program 159 times [2021-06-05 04:29:16,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:16,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127824512] [2021-06-05 04:29:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:16,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:16,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127824512] [2021-06-05 04:29:16,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127824512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:16,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957362140] [2021-06-05 04:29:16,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:16,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:16,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:16,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:29:16,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:16,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:16,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:16,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:16,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:16,790 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:16,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:16,795 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:16,799 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:16,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:16,837 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 04:29:16,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:16,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:16,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:16,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:16,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,958 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:16,958 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:16,962 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,964 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:16,965 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,967 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:29:16,967 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:16,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:16,970 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:17,001 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 04:29:17,001 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:17,002 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:17,002 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 04:29:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:17,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957362140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:17,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:17,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:29:17,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030813135] [2021-06-05 04:29:17,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:17,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:17,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:17,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:17,045 INFO L87 Difference]: Start difference. First operand 841 states and 3062 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:17,668 INFO L93 Difference]: Finished difference Result 1193 states and 4069 transitions. [2021-06-05 04:29:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:29:17,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:17,670 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 04:29:17,670 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 04:29:17,671 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 548.2ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:29:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 04:29:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 866. [2021-06-05 04:29:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 3.7179190751445086) internal successors, (3216), 865 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 3216 transitions. [2021-06-05 04:29:17,685 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 3216 transitions. Word has length 18 [2021-06-05 04:29:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:17,685 INFO L482 AbstractCegarLoop]: Abstraction has 866 states and 3216 transitions. [2021-06-05 04:29:17,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 3216 transitions. [2021-06-05 04:29:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:17,686 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:17,686 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:17,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 306 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3491 [2021-06-05 04:29:17,887 INFO L430 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290764, now seen corresponding path program 160 times [2021-06-05 04:29:17,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:17,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168064801] [2021-06-05 04:29:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:18,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:18,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168064801] [2021-06-05 04:29:18,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168064801] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:18,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172959314] [2021-06-05 04:29:18,069 INFO L93 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 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:18,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:29:18,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:18,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:29:18,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:18,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:18,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:18,212 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:18,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:18,247 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 04:29:18,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:18,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:18,411 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:18,416 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:18,421 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:18,493 INFO L628 ElimStorePlain]: treesize reduction 93, result has 38.4 percent of original size [2021-06-05 04:29:18,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:18,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:18,498 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:18,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:18,521 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:18,521 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:44 [2021-06-05 04:29:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:18,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172959314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:18,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:18,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:29:18,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663583647] [2021-06-05 04:29:18,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:29:18,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:29:18,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:29:18,584 INFO L87 Difference]: Start difference. First operand 866 states and 3216 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:18,856 INFO L93 Difference]: Finished difference Result 900 states and 3303 transitions. [2021-06-05 04:29:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:18,858 INFO L225 Difference]: With dead ends: 900 [2021-06-05 04:29:18,858 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 04:29:18,858 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 470.3ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:29:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 04:29:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 873. [2021-06-05 04:29:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.7121559633027523) internal successors, (3237), 872 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 3237 transitions. [2021-06-05 04:29:18,868 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 3237 transitions. Word has length 18 [2021-06-05 04:29:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:18,868 INFO L482 AbstractCegarLoop]: Abstraction has 873 states and 3237 transitions. [2021-06-05 04:29:18,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 3237 transitions. [2021-06-05 04:29:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:18,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:18,869 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:19,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3503 [2021-06-05 04:29:19,069 INFO L430 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -642697982, now seen corresponding path program 161 times [2021-06-05 04:29:19,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:19,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316698312] [2021-06-05 04:29:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:19,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:19,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316698312] [2021-06-05 04:29:19,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316698312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:19,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236312141] [2021-06-05 04:29:19,249 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:19,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:19,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:19,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:19,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:19,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:19,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:19,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:19,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:19,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:19,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:19,392 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 04:29:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:19,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:19,447 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:19,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:19,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:19,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:19,497 INFO L628 ElimStorePlain]: treesize reduction 87, result has 39.2 percent of original size [2021-06-05 04:29:19,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:19,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:19,501 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:19,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:19,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:29:19,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:19,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:19,540 INFO L518 ElimStorePlain]: Eliminatee v_prenex_881 vanished before elimination [2021-06-05 04:29:19,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:19,540 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 04:29:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:19,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236312141] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:19,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:19,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:19,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450068039] [2021-06-05 04:29:19,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:19,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:19,594 INFO L87 Difference]: Start difference. First operand 873 states and 3237 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:19,883 INFO L93 Difference]: Finished difference Result 902 states and 3320 transitions. [2021-06-05 04:29:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:19,883 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:19,885 INFO L225 Difference]: With dead ends: 902 [2021-06-05 04:29:19,885 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 04:29:19,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 349.0ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:29:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 04:29:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 870. [2021-06-05 04:29:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 04:29:19,894 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 04:29:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:19,894 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 04:29:19,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 04:29:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:19,895 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:19,895 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:20,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3515,308 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:20,096 INFO L430 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1516438662, now seen corresponding path program 162 times [2021-06-05 04:29:20,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:20,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058679232] [2021-06-05 04:29:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:20,311 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:20,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058679232] [2021-06-05 04:29:20,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058679232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:20,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363482706] [2021-06-05 04:29:20,311 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:20,339 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:29:20,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:20,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:20,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:20,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:20,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:20,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:20,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:20,454 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:29:20,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:20,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:20,502 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:20,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:20,505 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:20,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:20,508 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:20,511 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,547 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:29:20,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:20,550 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:20,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:20,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:20,564 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:20,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363482706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:20,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:20,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:20,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620954607] [2021-06-05 04:29:20,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:20,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:20,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:20,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:20,625 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:21,176 INFO L93 Difference]: Finished difference Result 905 states and 3329 transitions. [2021-06-05 04:29:21,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:21,177 INFO L225 Difference]: With dead ends: 905 [2021-06-05 04:29:21,177 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 04:29:21,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 629.4ms TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:29:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 04:29:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 870. [2021-06-05 04:29:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 04:29:21,186 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 04:29:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:21,187 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 04:29:21,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 04:29:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:21,188 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:21,188 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:21,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 309 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3525 [2021-06-05 04:29:21,388 INFO L430 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:21,388 INFO L82 PathProgramCache]: Analyzing trace with hash -967522252, now seen corresponding path program 163 times [2021-06-05 04:29:21,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:21,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632842795] [2021-06-05 04:29:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:21,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:21,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632842795] [2021-06-05 04:29:21,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632842795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:21,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278622544] [2021-06-05 04:29:21,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:21,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:29:21,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:21,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:21,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:21,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:21,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:21,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:21,806 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:21,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:21,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:21,810 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:21,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:21,813 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:21,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:21,859 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:21,859 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:29:22,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:22,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:22,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:22,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:22,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:22,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:22,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:22,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:22,033 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:22,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:22,036 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:22,075 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 04:29:22,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:22,078 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:22,092 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:22,093 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:22,093 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 04:29:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:22,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278622544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:22,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:22,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 04:29:22,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78518064] [2021-06-05 04:29:22,157 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:29:22,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:29:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:22,157 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:22,559 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 04:29:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:22,944 INFO L93 Difference]: Finished difference Result 909 states and 3329 transitions. [2021-06-05 04:29:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:22,945 INFO L225 Difference]: With dead ends: 909 [2021-06-05 04:29:22,945 INFO L226 Difference]: Without dead ends: 896 [2021-06-05 04:29:22,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 996.1ms TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-06-05 04:29:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 877. [2021-06-05 04:29:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7100456621004567) internal successors, (3250), 876 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3250 transitions. [2021-06-05 04:29:22,955 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3250 transitions. Word has length 18 [2021-06-05 04:29:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:22,955 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3250 transitions. [2021-06-05 04:29:22,955 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3250 transitions. [2021-06-05 04:29:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:22,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:22,956 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:23,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3536,310 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:23,157 INFO L430 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1387456298, now seen corresponding path program 164 times [2021-06-05 04:29:23,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:23,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384441753] [2021-06-05 04:29:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:23,450 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:23,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384441753] [2021-06-05 04:29:23,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384441753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:23,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495324572] [2021-06-05 04:29:23,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:23,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:23,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:23,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:23,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:23,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:23,560 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:23,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:23,567 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:23,570 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:23,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:23,605 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 04:29:23,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:23,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:23,724 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:23,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:23,727 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:23,730 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:23,764 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 04:29:23,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:23,768 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:23,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:23,782 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:23,782 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:23,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495324572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:23,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:23,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:23,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464317663] [2021-06-05 04:29:23,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:23,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:23,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:23,845 INFO L87 Difference]: Start difference. First operand 877 states and 3250 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:24,439 INFO L93 Difference]: Finished difference Result 917 states and 3367 transitions. [2021-06-05 04:29:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:24,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:24,441 INFO L225 Difference]: With dead ends: 917 [2021-06-05 04:29:24,441 INFO L226 Difference]: Without dead ends: 912 [2021-06-05 04:29:24,441 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 762.0ms TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:29:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-06-05 04:29:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 874. [2021-06-05 04:29:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 3.7124856815578466) internal successors, (3241), 873 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 3241 transitions. [2021-06-05 04:29:24,450 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 3241 transitions. Word has length 18 [2021-06-05 04:29:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:24,450 INFO L482 AbstractCegarLoop]: Abstraction has 874 states and 3241 transitions. [2021-06-05 04:29:24,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 3241 transitions. [2021-06-05 04:29:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:24,451 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:24,451 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:24,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3549,311 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:24,652 INFO L430 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash -760429270, now seen corresponding path program 165 times [2021-06-05 04:29:24,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:24,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92637059] [2021-06-05 04:29:24,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:24,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:24,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92637059] [2021-06-05 04:29:24,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92637059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:24,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097860135] [2021-06-05 04:29:24,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:24,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:24,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:24,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:24,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:24,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:24,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:24,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:24,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:24,997 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:24,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:24,999 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:25,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:25,002 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:25,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:25,057 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:143 [2021-06-05 04:29:25,173 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:29:25,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:25,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:25,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:25,184 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:25,188 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:25,230 INFO L628 ElimStorePlain]: treesize reduction 70, result has 41.2 percent of original size [2021-06-05 04:29:25,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:25,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:25,234 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:25,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:25,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:25,251 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:155, output treesize:41 [2021-06-05 04:29:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:25,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097860135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:25,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:25,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:29:25,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923599579] [2021-06-05 04:29:25,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:29:25,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:29:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:29:25,315 INFO L87 Difference]: Start difference. First operand 874 states and 3241 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:25,814 INFO L93 Difference]: Finished difference Result 914 states and 3363 transitions. [2021-06-05 04:29:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:25,816 INFO L225 Difference]: With dead ends: 914 [2021-06-05 04:29:25,816 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 04:29:25,816 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 624.1ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 04:29:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 876. [2021-06-05 04:29:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 3.7142857142857144) internal successors, (3250), 875 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 3250 transitions. [2021-06-05 04:29:25,825 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 3250 transitions. Word has length 18 [2021-06-05 04:29:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:25,825 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 3250 transitions. [2021-06-05 04:29:25,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 3250 transitions. [2021-06-05 04:29:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:25,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:25,826 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:26,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3564,312 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:26,027 INFO L430 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1410421392, now seen corresponding path program 166 times [2021-06-05 04:29:26,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:26,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998276428] [2021-06-05 04:29:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:26,440 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 04:29:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:26,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:26,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998276428] [2021-06-05 04:29:26,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998276428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:26,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188141918] [2021-06-05 04:29:26,830 INFO L93 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 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:26,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:29:26,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:26,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:26,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:26,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:26,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:26,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:26,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:26,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:26,968 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:26,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:26,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:26,972 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:26,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:26,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:27,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:27,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:27,020 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:29:27,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:27,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:27,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:27,191 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:27,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:27,191 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:29:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:27,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188141918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:27,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:27,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:27,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103051072] [2021-06-05 04:29:27,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:27,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:27,223 INFO L87 Difference]: Start difference. First operand 876 states and 3250 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:27,746 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 04:29:27,985 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-06-05 04:29:28,268 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-06-05 04:29:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:28,351 INFO L93 Difference]: Finished difference Result 914 states and 3350 transitions. [2021-06-05 04:29:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:28,351 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:28,353 INFO L225 Difference]: With dead ends: 914 [2021-06-05 04:29:28,353 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 04:29:28,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1727.1ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 04:29:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2021-06-05 04:29:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7170454545454548) internal successors, (3271), 880 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3271 transitions. [2021-06-05 04:29:28,362 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3271 transitions. Word has length 18 [2021-06-05 04:29:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:28,363 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3271 transitions. [2021-06-05 04:29:28,363 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3271 transitions. [2021-06-05 04:29:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:28,364 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:28,364 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:28,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3577,313 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:28,564 INFO L430 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 944557158, now seen corresponding path program 167 times [2021-06-05 04:29:28,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:28,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703331120] [2021-06-05 04:29:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:29,014 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:29,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703331120] [2021-06-05 04:29:29,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703331120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:29,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623659341] [2021-06-05 04:29:29,015 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:29,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:29:29,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:29,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 04:29:29,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:29,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:29,226 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:29:29,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:29:29,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:29,236 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:29:29,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 04:29:29,237 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:29,246 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:29:29,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 04:29:29,247 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,251 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:29:29,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 04:29:29,252 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,346 INFO L628 ElimStorePlain]: treesize reduction 8, result has 94.6 percent of original size [2021-06-05 04:29:29,347 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:29,348 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:211, output treesize:131 [2021-06-05 04:29:29,430 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_883], 1=[array_4, v_prenex_884]} [2021-06-05 04:29:29,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:29,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:29,436 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,476 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 04:29:29,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:29:29,479 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:29,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:29,493 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:29,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:29,496 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:29,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:29,510 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:29,511 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:29,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623659341] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:29,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:29,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:29:29,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831339065] [2021-06-05 04:29:29,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:29:29,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:29,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:29:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:29,575 INFO L87 Difference]: Start difference. First operand 881 states and 3271 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:30,015 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-05 04:29:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:30,325 INFO L93 Difference]: Finished difference Result 937 states and 3411 transitions. [2021-06-05 04:29:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:30,327 INFO L225 Difference]: With dead ends: 937 [2021-06-05 04:29:30,327 INFO L226 Difference]: Without dead ends: 932 [2021-06-05 04:29:30,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1059.6ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-06-05 04:29:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 877. [2021-06-05 04:29:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 04:29:30,337 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 04:29:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:30,337 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 04:29:30,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 04:29:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:30,339 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:30,339 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:30,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 314 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3591 [2021-06-05 04:29:30,539 INFO L430 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2143112230, now seen corresponding path program 168 times [2021-06-05 04:29:30,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:30,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425297735] [2021-06-05 04:29:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:31,011 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 04:29:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:31,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:31,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425297735] [2021-06-05 04:29:31,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425297735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:31,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395010078] [2021-06-05 04:29:31,336 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:31,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:29:31,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:31,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:31,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:31,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:31,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:31,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:31,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:31,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:31,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:31,475 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:31,478 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:31,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:31,523 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:29:31,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:31,699 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:29:31,701 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:31,713 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:29:31,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:31,715 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:31,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:31,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:31,722 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:29:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:31,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395010078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:31,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:31,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:31,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482279301] [2021-06-05 04:29:31,751 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:31,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:31,752 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:32,284 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 04:29:32,715 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 76 [2021-06-05 04:29:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:32,975 INFO L93 Difference]: Finished difference Result 911 states and 3339 transitions. [2021-06-05 04:29:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:29:32,975 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:32,977 INFO L225 Difference]: With dead ends: 911 [2021-06-05 04:29:32,977 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 04:29:32,977 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1750.5ms TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:29:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 04:29:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 877. [2021-06-05 04:29:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 04:29:32,986 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 04:29:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:32,986 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 04:29:32,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 04:29:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:32,988 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:32,988 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:33,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3606,315 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:33,188 INFO L430 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1636765964, now seen corresponding path program 169 times [2021-06-05 04:29:33,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:33,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344253226] [2021-06-05 04:29:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:33,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:33,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344253226] [2021-06-05 04:29:33,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344253226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:33,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865464694] [2021-06-05 04:29:33,703 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:33,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:33,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:33,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:33,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:33,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:33,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:33,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:33,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:33,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:33,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:33,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:33,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:33,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:33,889 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:33,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:33,933 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:29:33,933 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 04:29:34,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:34,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:34,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:34,047 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:34,047 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:34,047 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:29:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:34,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865464694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:34,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:34,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:34,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524552661] [2021-06-05 04:29:34,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:34,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:34,074 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:34,547 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 04:29:34,707 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 04:29:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:34,786 INFO L93 Difference]: Finished difference Result 906 states and 3325 transitions. [2021-06-05 04:29:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:34,787 INFO L225 Difference]: With dead ends: 906 [2021-06-05 04:29:34,788 INFO L226 Difference]: Without dead ends: 901 [2021-06-05 04:29:34,788 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1163.4ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:29:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-06-05 04:29:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 877. [2021-06-05 04:29:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 04:29:34,797 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 04:29:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:34,797 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 04:29:34,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 04:29:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:34,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:34,798 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:34,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3621,316 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:34,999 INFO L430 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:34,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 233346690, now seen corresponding path program 170 times [2021-06-05 04:29:34,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:34,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423078124] [2021-06-05 04:29:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:35,571 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 04:29:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:35,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:35,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423078124] [2021-06-05 04:29:35,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423078124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:35,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793750559] [2021-06-05 04:29:35,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:35,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:35,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:35,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:35,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:35,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:35,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:35,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:35,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:35,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:35,941 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:35,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:35,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:35,945 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:35,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:35,948 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:35,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:35,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:35,983 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 04:29:36,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:36,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:36,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:36,069 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:29:36,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:36,077 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:36,080 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:29:36,084 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:36,088 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:36,201 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2021-06-05 04:29:36,201 INFO L628 ElimStorePlain]: treesize reduction 118, result has 50.6 percent of original size [2021-06-05 04:29:36,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:29:36,205 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:36,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:36,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:36,209 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:36,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:29:36,213 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:36,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:36,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:29:36,254 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:305, output treesize:97 [2021-06-05 04:29:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:36,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793750559] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:36,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:36,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:36,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182565543] [2021-06-05 04:29:36,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:36,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:36,394 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:37,055 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2021-06-05 04:29:37,271 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 04:29:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:37,680 INFO L93 Difference]: Finished difference Result 946 states and 3440 transitions. [2021-06-05 04:29:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:29:37,680 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:37,682 INFO L225 Difference]: With dead ends: 946 [2021-06-05 04:29:37,682 INFO L226 Difference]: Without dead ends: 941 [2021-06-05 04:29:37,682 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1768.4ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:29:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-06-05 04:29:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 881. [2021-06-05 04:29:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.715909090909091) internal successors, (3270), 880 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3270 transitions. [2021-06-05 04:29:37,692 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3270 transitions. Word has length 18 [2021-06-05 04:29:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:37,692 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3270 transitions. [2021-06-05 04:29:37,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3270 transitions. [2021-06-05 04:29:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:37,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:37,693 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:37,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 317 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3635 [2021-06-05 04:29:37,893 INFO L430 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1594902796, now seen corresponding path program 171 times [2021-06-05 04:29:37,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:37,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41605963] [2021-06-05 04:29:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:38,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:38,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41605963] [2021-06-05 04:29:38,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41605963] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:38,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604624151] [2021-06-05 04:29:38,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:38,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:38,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:38,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:38,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:38,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:38,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:38,654 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:38,658 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:38,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:38,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:38,697 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 04:29:38,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:38,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:29:38,788 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:29:38,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:38,795 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:38,799 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:38,803 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:38,806 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:38,809 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:38,902 INFO L628 ElimStorePlain]: treesize reduction 122, result has 48.1 percent of original size [2021-06-05 04:29:38,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:38,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:38,906 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:38,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:29:38,910 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:38,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:38,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:29:38,951 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:305, output treesize:97 [2021-06-05 04:29:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:39,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604624151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:39,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:39,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:39,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141050895] [2021-06-05 04:29:39,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:39,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:39,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:39,128 INFO L87 Difference]: Start difference. First operand 881 states and 3270 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:39,447 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 54 [2021-06-05 04:29:39,625 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2021-06-05 04:29:40,192 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2021-06-05 04:29:40,393 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 04:29:40,827 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2021-06-05 04:29:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:40,981 INFO L93 Difference]: Finished difference Result 928 states and 3392 transitions. [2021-06-05 04:29:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:29:40,981 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:40,983 INFO L225 Difference]: With dead ends: 928 [2021-06-05 04:29:40,983 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 04:29:40,983 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2200.0ms TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:29:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 04:29:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 879. [2021-06-05 04:29:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.715261958997722) internal successors, (3262), 878 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3262 transitions. [2021-06-05 04:29:40,993 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3262 transitions. Word has length 18 [2021-06-05 04:29:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:40,993 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3262 transitions. [2021-06-05 04:29:40,993 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3262 transitions. [2021-06-05 04:29:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:40,994 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:40,994 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:41,194 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3651,318 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:41,195 INFO L430 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2132758374, now seen corresponding path program 172 times [2021-06-05 04:29:41,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:41,195 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830382150] [2021-06-05 04:29:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:41,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:41,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830382150] [2021-06-05 04:29:41,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830382150] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:41,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239361102] [2021-06-05 04:29:41,645 INFO L93 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 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:41,670 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:29:41,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:41,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:29:41,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:41,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:41,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:41,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:41,778 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:41,782 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:41,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:41,828 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:169, output treesize:131 [2021-06-05 04:29:41,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:41,982 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:41,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:41,991 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:41,995 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:41,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:41,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:29:41,999 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:29:42,003 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:42,007 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:42,012 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:42,016 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:42,020 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:42,024 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:29:42,028 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,173 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-06-05 04:29:42,173 INFO L628 ElimStorePlain]: treesize reduction 201, result has 46.7 percent of original size [2021-06-05 04:29:42,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:29:42,178 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:42,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:42,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:42,181 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:42,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:29:42,185 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:42,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:42,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 04:29:42,247 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:461, output treesize:148 [2021-06-05 04:29:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:42,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239361102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:42,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:42,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 04:29:42,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527367172] [2021-06-05 04:29:42,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:29:42,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:29:42,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:42,403 INFO L87 Difference]: Start difference. First operand 879 states and 3262 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:42,845 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-06-05 04:29:43,088 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 61 [2021-06-05 04:29:43,295 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 04:29:43,565 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2021-06-05 04:29:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:43,675 INFO L93 Difference]: Finished difference Result 913 states and 3340 transitions. [2021-06-05 04:29:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:29:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:43,677 INFO L225 Difference]: With dead ends: 913 [2021-06-05 04:29:43,677 INFO L226 Difference]: Without dead ends: 902 [2021-06-05 04:29:43,677 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1663.8ms TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-06-05 04:29:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 880. [2021-06-05 04:29:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7110352673492604) internal successors, (3262), 879 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3262 transitions. [2021-06-05 04:29:43,686 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3262 transitions. Word has length 18 [2021-06-05 04:29:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:43,686 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3262 transitions. [2021-06-05 04:29:43,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3262 transitions. [2021-06-05 04:29:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:43,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:43,688 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:43,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 319 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3669 [2021-06-05 04:29:43,888 INFO L430 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2089126690, now seen corresponding path program 173 times [2021-06-05 04:29:43,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:43,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504358228] [2021-06-05 04:29:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:44,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:44,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504358228] [2021-06-05 04:29:44,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504358228] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:44,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672931602] [2021-06-05 04:29:44,589 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:44,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:29:44,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:44,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:44,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:44,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:44,714 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:44,717 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:44,720 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:44,724 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:44,759 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:44,759 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 04:29:44,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:44,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:44,878 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:44,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:44,881 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:44,884 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:44,918 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 04:29:44,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:44,921 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:44,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:44,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:44,936 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:45,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672931602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:45,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:45,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:29:45,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340555706] [2021-06-05 04:29:45,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:29:45,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:45,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:29:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:29:45,015 INFO L87 Difference]: Start difference. First operand 880 states and 3262 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:45,535 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2021-06-05 04:29:45,732 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 04:29:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:46,090 INFO L93 Difference]: Finished difference Result 919 states and 3375 transitions. [2021-06-05 04:29:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:46,092 INFO L225 Difference]: With dead ends: 919 [2021-06-05 04:29:46,092 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 04:29:46,092 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1526.4ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:29:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 04:29:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 883. [2021-06-05 04:29:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 04:29:46,101 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 04:29:46,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:46,101 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 04:29:46,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 04:29:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:46,102 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:46,103 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:46,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3684,320 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:46,303 INFO L430 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 214606282, now seen corresponding path program 174 times [2021-06-05 04:29:46,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:46,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185749490] [2021-06-05 04:29:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:46,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:46,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185749490] [2021-06-05 04:29:46,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185749490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:46,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469548622] [2021-06-05 04:29:46,507 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:46,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:29:46,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:46,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:46,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:46,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:46,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:46,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:46,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:46,652 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:46,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:46,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:46,677 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:29:46,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:46,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:46,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:46,761 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:46,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:46,762 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:29:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:46,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469548622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:46,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:46,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:46,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721110540] [2021-06-05 04:29:46,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:46,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:46,787 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:47,257 INFO L93 Difference]: Finished difference Result 964 states and 3516 transitions. [2021-06-05 04:29:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:47,259 INFO L225 Difference]: With dead ends: 964 [2021-06-05 04:29:47,259 INFO L226 Difference]: Without dead ends: 959 [2021-06-05 04:29:47,259 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 517.2ms TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:29:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-06-05 04:29:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 892. [2021-06-05 04:29:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 04:29:47,269 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 04:29:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:47,269 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 04:29:47,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 04:29:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:47,270 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:47,270 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:47,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3699,321 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:47,471 INFO L430 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1725382464, now seen corresponding path program 175 times [2021-06-05 04:29:47,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:47,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817108042] [2021-06-05 04:29:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:47,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:47,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817108042] [2021-06-05 04:29:47,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817108042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:47,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82338223] [2021-06-05 04:29:47,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:47,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:29:47,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:47,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:47,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:47,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:47,839 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,862 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:47,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:47,863 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 04:29:47,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:47,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:47,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:47,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:47,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:47,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:47,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:47,932 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:47,985 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 04:29:47,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:47,988 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:48,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:48,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:48,011 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:29:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:48,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82338223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:48,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:48,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 04:29:48,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81128413] [2021-06-05 04:29:48,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:29:48,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:29:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:48,125 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:48,904 INFO L93 Difference]: Finished difference Result 974 states and 3541 transitions. [2021-06-05 04:29:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:48,906 INFO L225 Difference]: With dead ends: 974 [2021-06-05 04:29:48,906 INFO L226 Difference]: Without dead ends: 962 [2021-06-05 04:29:48,906 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 864.4ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:29:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-06-05 04:29:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 889. [2021-06-05 04:29:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.704954954954955) internal successors, (3290), 888 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3290 transitions. [2021-06-05 04:29:48,925 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3290 transitions. Word has length 18 [2021-06-05 04:29:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:48,925 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3290 transitions. [2021-06-05 04:29:48,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3290 transitions. [2021-06-05 04:29:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:48,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:48,926 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:49,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 322 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3709 [2021-06-05 04:29:49,127 INFO L430 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1695844152, now seen corresponding path program 176 times [2021-06-05 04:29:49,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:49,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630392615] [2021-06-05 04:29:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:49,404 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:49,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630392615] [2021-06-05 04:29:49,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630392615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:49,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427325540] [2021-06-05 04:29:49,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:49,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:49,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:49,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:49,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:49,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:49,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:49,531 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:49,534 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:49,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:49,555 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:29:49,603 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_885], 1=[array_4, v_prenex_886]} [2021-06-05 04:29:49,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:49,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:49,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,650 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 04:29:49,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:49,653 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:49,667 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:49,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:29:49,670 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:49,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:49,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:49,684 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:49,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427325540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:49,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:49,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:49,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910688057] [2021-06-05 04:29:49,746 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:49,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:49,747 INFO L87 Difference]: Start difference. First operand 889 states and 3290 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:50,451 INFO L93 Difference]: Finished difference Result 982 states and 3566 transitions. [2021-06-05 04:29:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:50,453 INFO L225 Difference]: With dead ends: 982 [2021-06-05 04:29:50,453 INFO L226 Difference]: Without dead ends: 977 [2021-06-05 04:29:50,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 776.7ms TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:29:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-06-05 04:29:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 892. [2021-06-05 04:29:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 04:29:50,463 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 04:29:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:50,463 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 04:29:50,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 04:29:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:50,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:50,464 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:50,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 323 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3719 [2021-06-05 04:29:50,664 INFO L430 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 24868136, now seen corresponding path program 177 times [2021-06-05 04:29:50,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:50,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709151360] [2021-06-05 04:29:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:50,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:50,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709151360] [2021-06-05 04:29:50,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709151360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:50,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857771919] [2021-06-05 04:29:50,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:50,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:50,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:50,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:50,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:51,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:51,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:51,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:51,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:51,024 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:51,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:51,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:51,045 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 04:29:51,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:51,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:51,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:51,129 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:29:51,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:51,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:29:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:51,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857771919] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:51,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:51,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:51,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081087832] [2021-06-05 04:29:51,156 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:51,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:51,157 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:51,645 INFO L93 Difference]: Finished difference Result 965 states and 3523 transitions. [2021-06-05 04:29:51,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:51,646 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:51,647 INFO L225 Difference]: With dead ends: 965 [2021-06-05 04:29:51,647 INFO L226 Difference]: Without dead ends: 960 [2021-06-05 04:29:51,647 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 511.6ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:29:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-06-05 04:29:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 886. [2021-06-05 04:29:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 04:29:51,657 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 04:29:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:51,657 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 04:29:51,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 04:29:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:51,658 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:51,658 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:51,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3730,324 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:51,858 INFO L430 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1124389346, now seen corresponding path program 178 times [2021-06-05 04:29:51,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:51,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854593377] [2021-06-05 04:29:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:52,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:52,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854593377] [2021-06-05 04:29:52,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854593377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:52,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118023166] [2021-06-05 04:29:52,050 INFO L93 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 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:52,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:29:52,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:52,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:52,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:52,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:52,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:52,154 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:52,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:52,163 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:34 [2021-06-05 04:29:52,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:52,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:52,230 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:52,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:52,233 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:52,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:52,236 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:52,239 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:52,274 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 04:29:52,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:52,281 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:52,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:52,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:52,295 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:29:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:52,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118023166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:52,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:52,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:29:52,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244471910] [2021-06-05 04:29:52,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:29:52,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:29:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:29:52,356 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:53,026 INFO L93 Difference]: Finished difference Result 1055 states and 3833 transitions. [2021-06-05 04:29:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:29:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:53,028 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 04:29:53,028 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 04:29:53,028 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 635.2ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:29:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 04:29:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 883. [2021-06-05 04:29:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 04:29:53,038 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 04:29:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:53,039 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 04:29:53,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 04:29:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:53,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:53,040 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:53,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3740,325 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:53,240 INFO L430 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:53,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1083309636, now seen corresponding path program 179 times [2021-06-05 04:29:53,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:53,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424684490] [2021-06-05 04:29:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:53,424 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:53,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424684490] [2021-06-05 04:29:53,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424684490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:53,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194950273] [2021-06-05 04:29:53,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:53,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:53,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:53,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:53,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:53,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:53,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:53,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:53,570 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:53,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:53,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:29:53,605 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:85 [2021-06-05 04:29:53,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:53,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:53,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:53,771 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:53,819 INFO L628 ElimStorePlain]: treesize reduction 79, result has 45.1 percent of original size [2021-06-05 04:29:53,819 INFO L518 ElimStorePlain]: Eliminatee v_prenex_889 vanished before elimination [2021-06-05 04:29:53,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:53,823 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:53,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:53,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:53,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:53,841 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:53,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:53,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:53,857 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:16 [2021-06-05 04:29:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:53,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194950273] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:53,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:53,872 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:53,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536115090] [2021-06-05 04:29:53,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:53,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:53,873 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:54,130 INFO L93 Difference]: Finished difference Result 925 states and 3382 transitions. [2021-06-05 04:29:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:54,132 INFO L225 Difference]: With dead ends: 925 [2021-06-05 04:29:54,132 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 04:29:54,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 343.7ms TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:29:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 04:29:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 889. [2021-06-05 04:29:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.7083333333333335) internal successors, (3293), 888 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3293 transitions. [2021-06-05 04:29:54,141 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3293 transitions. Word has length 18 [2021-06-05 04:29:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:54,141 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3293 transitions. [2021-06-05 04:29:54,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3293 transitions. [2021-06-05 04:29:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:54,143 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:54,143 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:54,343 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3750,326 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:54,343 INFO L430 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:54,343 INFO L82 PathProgramCache]: Analyzing trace with hash -856679110, now seen corresponding path program 180 times [2021-06-05 04:29:54,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:54,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175297995] [2021-06-05 04:29:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:54,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:54,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175297995] [2021-06-05 04:29:54,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175297995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:54,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728869772] [2021-06-05 04:29:54,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:54,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:29:54,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:54,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:54,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:54,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:54,664 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:54,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:54,667 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:54,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:54,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:29:54,700 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 04:29:54,785 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_895], 3=[array_2, v_prenex_892]} [2021-06-05 04:29:54,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:54,790 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:54,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:29:54,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:54,856 INFO L628 ElimStorePlain]: treesize reduction 107, result has 42.2 percent of original size [2021-06-05 04:29:54,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:29:54,860 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:54,883 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:54,884 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:29:54,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:54,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:29:54,888 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:54,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:54,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:54,912 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 04:29:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:54,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728869772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:54,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:54,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:54,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393168741] [2021-06-05 04:29:54,960 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:54,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:54,961 INFO L87 Difference]: Start difference. First operand 889 states and 3293 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:55,196 INFO L93 Difference]: Finished difference Result 935 states and 3414 transitions. [2021-06-05 04:29:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:55,196 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:55,198 INFO L225 Difference]: With dead ends: 935 [2021-06-05 04:29:55,198 INFO L226 Difference]: Without dead ends: 930 [2021-06-05 04:29:55,198 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 328.6ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:29:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-06-05 04:29:55,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 886. [2021-06-05 04:29:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 04:29:55,208 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 04:29:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:55,208 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 04:29:55,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 04:29:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:55,209 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:55,209 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:55,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3777,327 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:55,410 INFO L430 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1730419790, now seen corresponding path program 181 times [2021-06-05 04:29:55,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:55,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125800730] [2021-06-05 04:29:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:55,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:55,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125800730] [2021-06-05 04:29:55,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125800730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:55,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392592884] [2021-06-05 04:29:55,605 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:55,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:29:55,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:55,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:55,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:55,761 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:55,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 04:29:55,794 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:82 [2021-06-05 04:29:55,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:55,888 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:55,893 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:55,898 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:55,902 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:55,968 INFO L628 ElimStorePlain]: treesize reduction 106, result has 40.1 percent of original size [2021-06-05 04:29:55,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:55,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:55,972 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:55,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:55,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:55,997 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:35 [2021-06-05 04:29:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:56,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392592884] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:56,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:56,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:56,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838700558] [2021-06-05 04:29:56,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:56,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:56,047 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:56,434 INFO L93 Difference]: Finished difference Result 930 states and 3404 transitions. [2021-06-05 04:29:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:56,434 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:56,436 INFO L225 Difference]: With dead ends: 930 [2021-06-05 04:29:56,436 INFO L226 Difference]: Without dead ends: 925 [2021-06-05 04:29:56,436 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 427.1ms TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:29:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-06-05 04:29:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 883. [2021-06-05 04:29:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 04:29:56,445 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 04:29:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:56,446 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 04:29:56,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 04:29:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:56,454 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:56,454 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:56,654 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3790,328 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:56,655 INFO L430 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:56,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1181503380, now seen corresponding path program 182 times [2021-06-05 04:29:56,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:56,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890303662] [2021-06-05 04:29:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:56,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:56,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890303662] [2021-06-05 04:29:56,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890303662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:56,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101653692] [2021-06-05 04:29:56,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:56,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:29:56,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:56,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:56,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:57,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:57,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:57,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:57,083 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:57,087 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:57,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:57,145 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:173 [2021-06-05 04:29:57,431 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_903, array_4], 3=[v_prenex_902, array_2]} [2021-06-05 04:29:57,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:57,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:57,440 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,480 INFO L628 ElimStorePlain]: treesize reduction 91, result has 41.7 percent of original size [2021-06-05 04:29:57,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:29:57,483 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:57,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:57,498 INFO L518 ElimStorePlain]: Eliminatee v_prenex_902 vanished before elimination [2021-06-05 04:29:57,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:57,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:57,502 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:57,516 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:57,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:57,517 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 04:29:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:57,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101653692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:57,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:57,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 04:29:57,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849302820] [2021-06-05 04:29:57,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:29:57,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:29:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:29:57,546 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:57,904 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 04:29:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:58,275 INFO L93 Difference]: Finished difference Result 928 states and 3388 transitions. [2021-06-05 04:29:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:58,277 INFO L225 Difference]: With dead ends: 928 [2021-06-05 04:29:58,277 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 04:29:58,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 942.0ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:29:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 04:29:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 887. [2021-06-05 04:29:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.7121896162528216) internal successors, (3289), 886 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3289 transitions. [2021-06-05 04:29:58,287 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3289 transitions. Word has length 18 [2021-06-05 04:29:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:58,287 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3289 transitions. [2021-06-05 04:29:58,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3289 transitions. [2021-06-05 04:29:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:58,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:58,288 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:29:58,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 329 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3805 [2021-06-05 04:29:58,488 INFO L430 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:29:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:29:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1173475170, now seen corresponding path program 183 times [2021-06-05 04:29:58,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:29:58,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934960155] [2021-06-05 04:29:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:29:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:29:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:58,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:29:58,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934960155] [2021-06-05 04:29:58,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934960155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:58,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516958812] [2021-06-05 04:29:58,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:29:58,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:29:58,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:29:58,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:29:58,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:29:58,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:29:58,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:58,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:58,830 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:58,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:29:58,834 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:58,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:58,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:58,838 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:58,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:58,883 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:29:58,883 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:187, output treesize:155 [2021-06-05 04:29:59,115 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:29:59,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:29:59,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:59,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:59,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:59,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:29:59,128 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:59,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:29:59,132 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:29:59,191 INFO L628 ElimStorePlain]: treesize reduction 99, result has 40.7 percent of original size [2021-06-05 04:29:59,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:29:59,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:29:59,195 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:29:59,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:29:59,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:29:59,218 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:201, output treesize:75 [2021-06-05 04:29:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:29:59,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516958812] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:29:59,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:29:59,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:29:59,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798889927] [2021-06-05 04:29:59,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:29:59,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:29:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:29:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:29:59,300 INFO L87 Difference]: Start difference. First operand 887 states and 3289 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:59,574 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 04:29:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:29:59,922 INFO L93 Difference]: Finished difference Result 944 states and 3442 transitions. [2021-06-05 04:29:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:29:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:29:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:29:59,923 INFO L225 Difference]: With dead ends: 944 [2021-06-05 04:29:59,924 INFO L226 Difference]: Without dead ends: 939 [2021-06-05 04:29:59,924 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 771.6ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:29:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-06-05 04:29:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 883. [2021-06-05 04:29:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 04:29:59,933 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 04:29:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:29:59,933 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 04:29:59,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:29:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 04:29:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:29:59,934 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:29:59,934 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:00,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3821,330 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:00,135 INFO L430 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash -974410398, now seen corresponding path program 184 times [2021-06-05 04:30:00,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:00,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572651994] [2021-06-05 04:30:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:00,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:00,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572651994] [2021-06-05 04:30:00,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572651994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:00,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281810324] [2021-06-05 04:30:00,402 INFO L93 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 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:00,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:00,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:00,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:00,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:00,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:00,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:00,541 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:00,545 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:00,549 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:00,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:30:00,605 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:157 [2021-06-05 04:30:00,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:00,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:00,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:00,863 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:00,867 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:00,934 INFO L628 ElimStorePlain]: treesize reduction 92, result has 43.6 percent of original size [2021-06-05 04:30:00,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:00,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:00,938 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:00,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:00,962 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:00,962 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:199, output treesize:35 [2021-06-05 04:30:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:01,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281810324] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:01,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:01,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:30:01,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355935362] [2021-06-05 04:30:01,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:01,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:01,024 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:01,305 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2021-06-05 04:30:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:01,550 INFO L93 Difference]: Finished difference Result 932 states and 3416 transitions. [2021-06-05 04:30:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:01,552 INFO L225 Difference]: With dead ends: 932 [2021-06-05 04:30:01,552 INFO L226 Difference]: Without dead ends: 927 [2021-06-05 04:30:01,552 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 725.7ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-06-05 04:30:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 884. [2021-06-05 04:30:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.710079275198188) internal successors, (3276), 883 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3276 transitions. [2021-06-05 04:30:01,562 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3276 transitions. Word has length 18 [2021-06-05 04:30:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:01,562 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3276 transitions. [2021-06-05 04:30:01,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3276 transitions. [2021-06-05 04:30:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:01,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:01,563 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:01,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 331 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3848 [2021-06-05 04:30:01,764 INFO L430 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1209123278, now seen corresponding path program 185 times [2021-06-05 04:30:01,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:01,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502768514] [2021-06-05 04:30:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:02,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:02,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502768514] [2021-06-05 04:30:02,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502768514] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:02,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395192177] [2021-06-05 04:30:02,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:02,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:02,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:02,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:02,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:02,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:02,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:02,146 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:02,149 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:02,152 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:02,176 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:02,176 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 04:30:02,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:02,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:02,297 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,299 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:02,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:02,300 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:02,303 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:02,338 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 04:30:02,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:02,341 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:02,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:02,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:02,356 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:30:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:02,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395192177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:02,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:02,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:02,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951881262] [2021-06-05 04:30:02,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:02,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:02,420 INFO L87 Difference]: Start difference. First operand 884 states and 3276 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:03,263 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 04:30:03,398 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 04:30:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:03,470 INFO L93 Difference]: Finished difference Result 1062 states and 3819 transitions. [2021-06-05 04:30:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:03,472 INFO L225 Difference]: With dead ends: 1062 [2021-06-05 04:30:03,472 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 04:30:03,472 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1052.2ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 04:30:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 886. [2021-06-05 04:30:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7096045197740115) internal successors, (3283), 885 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3283 transitions. [2021-06-05 04:30:03,483 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3283 transitions. Word has length 18 [2021-06-05 04:30:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:03,483 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3283 transitions. [2021-06-05 04:30:03,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3283 transitions. [2021-06-05 04:30:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:03,484 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:03,484 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:03,685 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3875,332 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:03,685 INFO L430 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash 65825400, now seen corresponding path program 186 times [2021-06-05 04:30:03,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:03,686 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234303432] [2021-06-05 04:30:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:04,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:04,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234303432] [2021-06-05 04:30:04,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234303432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:04,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222685078] [2021-06-05 04:30:04,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:04,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:30:04,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:04,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:04,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:04,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:04,141 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:04,144 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:04,147 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:04,150 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:04,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:04,175 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 04:30:04,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:04,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:04,317 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:04,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:04,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:04,323 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,358 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 04:30:04,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:04,361 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:04,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:04,375 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:04,375 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:30:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:04,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222685078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:04,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:04,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:04,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465193072] [2021-06-05 04:30:04,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:04,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:04,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:04,439 INFO L87 Difference]: Start difference. First operand 886 states and 3283 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:05,115 INFO L93 Difference]: Finished difference Result 978 states and 3533 transitions. [2021-06-05 04:30:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:05,117 INFO L225 Difference]: With dead ends: 978 [2021-06-05 04:30:05,117 INFO L226 Difference]: Without dead ends: 973 [2021-06-05 04:30:05,118 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 858.8ms TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:30:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-06-05 04:30:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 884. [2021-06-05 04:30:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 04:30:05,128 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 04:30:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:05,128 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 04:30:05,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 04:30:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:05,129 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:05,129 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:05,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 333 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3889 [2021-06-05 04:30:05,330 INFO L430 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 660823910, now seen corresponding path program 187 times [2021-06-05 04:30:05,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:05,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482572618] [2021-06-05 04:30:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:05,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:05,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482572618] [2021-06-05 04:30:05,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482572618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:05,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356758244] [2021-06-05 04:30:05,529 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:05,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:05,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:05,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:05,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:05,675 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,713 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:05,715 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:05,715 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:97 [2021-06-05 04:30:05,867 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:30:05,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:05,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:05,876 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:05,881 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:05,884 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:05,948 INFO L628 ElimStorePlain]: treesize reduction 106, result has 40.1 percent of original size [2021-06-05 04:30:05,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:05,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:05,952 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:05,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:05,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:05,976 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:207, output treesize:78 [2021-06-05 04:30:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:06,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356758244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:06,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:06,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:30:06,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690672792] [2021-06-05 04:30:06,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:06,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:06,056 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:06,303 INFO L93 Difference]: Finished difference Result 917 states and 3361 transitions. [2021-06-05 04:30:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:06,305 INFO L225 Difference]: With dead ends: 917 [2021-06-05 04:30:06,305 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 04:30:06,305 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 440.2ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:30:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 04:30:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2021-06-05 04:30:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 04:30:06,315 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 04:30:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:06,315 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 04:30:06,315 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 04:30:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:06,316 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:06,317 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:06,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3903,334 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:06,517 INFO L430 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1279164836, now seen corresponding path program 188 times [2021-06-05 04:30:06,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:06,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403375664] [2021-06-05 04:30:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:06,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:06,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403375664] [2021-06-05 04:30:06,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403375664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:06,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981356013] [2021-06-05 04:30:06,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:06,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:06,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:06,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:06,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:06,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:06,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:06,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:06,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:06,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:06,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:06,893 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 04:30:06,980 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_919], 3=[array_2, v_prenex_918]} [2021-06-05 04:30:06,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:06,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:06,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:06,990 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:07,052 INFO L628 ElimStorePlain]: treesize reduction 107, result has 42.2 percent of original size [2021-06-05 04:30:07,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:07,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:30:07,056 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:07,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:07,080 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:30:07,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:07,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:30:07,084 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:07,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:07,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:07,109 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 04:30:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:07,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981356013] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:07,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:07,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:30:07,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116842634] [2021-06-05 04:30:07,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:07,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:07,158 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:07,501 INFO L93 Difference]: Finished difference Result 919 states and 3378 transitions. [2021-06-05 04:30:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:07,502 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:07,503 INFO L225 Difference]: With dead ends: 919 [2021-06-05 04:30:07,503 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 04:30:07,503 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 360.0ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 04:30:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 887. [2021-06-05 04:30:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.708803611738149) internal successors, (3286), 886 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3286 transitions. [2021-06-05 04:30:07,513 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3286 transitions. Word has length 18 [2021-06-05 04:30:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:07,513 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3286 transitions. [2021-06-05 04:30:07,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3286 transitions. [2021-06-05 04:30:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:07,515 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:07,515 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:07,715 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3930,335 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:07,715 INFO L430 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2142061780, now seen corresponding path program 189 times [2021-06-05 04:30:07,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:07,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548216415] [2021-06-05 04:30:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:07,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:07,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548216415] [2021-06-05 04:30:07,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548216415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:07,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270552737] [2021-06-05 04:30:07,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:08,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:30:08,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:08,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:08,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:08,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:08,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:08,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:08,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:08,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:08,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:08,142 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:08,143 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:30:08,191 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_923, array_0], 1=[v_prenex_924, array_4]} [2021-06-05 04:30:08,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:08,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:08,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:08,197 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:08,235 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 04:30:08,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:08,238 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:08,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:08,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:08,255 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:08,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:08,269 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:30:08,269 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:08,269 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:30:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:08,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270552737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:08,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:08,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:08,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183450096] [2021-06-05 04:30:08,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:08,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:08,333 INFO L87 Difference]: Start difference. First operand 887 states and 3286 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:09,087 INFO L93 Difference]: Finished difference Result 930 states and 3401 transitions. [2021-06-05 04:30:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:09,089 INFO L225 Difference]: With dead ends: 930 [2021-06-05 04:30:09,089 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 04:30:09,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 852.1ms TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 04:30:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 884. [2021-06-05 04:30:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 04:30:09,098 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 04:30:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:09,098 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 04:30:09,098 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:09,098 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 04:30:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:09,100 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:09,100 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:09,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3943,336 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:09,300 INFO L430 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1603989106, now seen corresponding path program 190 times [2021-06-05 04:30:09,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:09,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583465821] [2021-06-05 04:30:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:09,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:09,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583465821] [2021-06-05 04:30:09,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583465821] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:09,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943862674] [2021-06-05 04:30:09,556 INFO L93 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 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:09,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:09,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:09,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:09,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:09,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:09,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:09,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:09,664 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:09,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:09,668 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:09,670 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:09,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:09,671 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:09,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:09,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:09,730 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:173 [2021-06-05 04:30:10,047 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:30:10,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:10,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:10,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:10,056 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:10,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:10,061 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:10,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:10,065 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:10,128 INFO L628 ElimStorePlain]: treesize reduction 102, result has 41.0 percent of original size [2021-06-05 04:30:10,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:10,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:10,132 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:10,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:10,155 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:10,155 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:207, output treesize:78 [2021-06-05 04:30:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:10,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943862674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:10,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:10,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:30:10,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721194077] [2021-06-05 04:30:10,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:10,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:10,237 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:10,489 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 04:30:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:10,666 INFO L93 Difference]: Finished difference Result 922 states and 3374 transitions. [2021-06-05 04:30:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:10,668 INFO L225 Difference]: With dead ends: 922 [2021-06-05 04:30:10,668 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 04:30:10,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 749.3ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 04:30:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 890. [2021-06-05 04:30:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 04:30:10,678 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 04:30:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:10,678 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 04:30:10,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 04:30:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:10,679 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:10,679 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:10,879 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 337 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3954 [2021-06-05 04:30:10,880 INFO L430 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:10,880 INFO L82 PathProgramCache]: Analyzing trace with hash 750989444, now seen corresponding path program 191 times [2021-06-05 04:30:10,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:10,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703671354] [2021-06-05 04:30:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:11,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:11,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703671354] [2021-06-05 04:30:11,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703671354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:11,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624905115] [2021-06-05 04:30:11,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:11,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:11,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:11,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:11,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:11,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:11,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:11,295 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:11,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:11,299 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:11,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:11,302 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:11,305 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:11,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:11,361 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:30:11,482 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_928], 1=[array_4, v_prenex_929]} [2021-06-05 04:30:11,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:11,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:11,489 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,529 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 04:30:11,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:30:11,532 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:11,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:11,546 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:30:11,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:11,549 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:11,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:11,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:11,564 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:30:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:11,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624905115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:11,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:11,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:11,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57151703] [2021-06-05 04:30:11,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:11,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:11,627 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:12,018 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 04:30:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:12,432 INFO L93 Difference]: Finished difference Result 939 states and 3429 transitions. [2021-06-05 04:30:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:12,434 INFO L225 Difference]: With dead ends: 939 [2021-06-05 04:30:12,434 INFO L226 Difference]: Without dead ends: 929 [2021-06-05 04:30:12,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 979.0ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-06-05 04:30:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 883. [2021-06-05 04:30:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.7108843537414966) internal successors, (3273), 882 states have internal predecessors, (3273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3273 transitions. [2021-06-05 04:30:12,445 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3273 transitions. Word has length 18 [2021-06-05 04:30:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:12,445 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3273 transitions. [2021-06-05 04:30:12,445 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3273 transitions. [2021-06-05 04:30:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:12,446 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:12,446 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:12,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3982,338 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:12,647 INFO L430 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1396896124, now seen corresponding path program 192 times [2021-06-05 04:30:12,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:12,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262062449] [2021-06-05 04:30:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:12,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:12,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262062449] [2021-06-05 04:30:12,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262062449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:12,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7914360] [2021-06-05 04:30:12,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:13,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:30:13,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:13,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:13,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:13,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:13,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,134 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:13,135 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:13,140 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:13,144 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:13,199 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:30:13,200 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 04:30:13,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:13,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:13,463 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:13,468 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:13,472 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,531 INFO L628 ElimStorePlain]: treesize reduction 96, result has 44.5 percent of original size [2021-06-05 04:30:13,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:13,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:13,535 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:13,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:13,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:13,560 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 04:30:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:13,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7914360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:13,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:13,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:30:13,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789888497] [2021-06-05 04:30:13,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:13,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:13,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:13,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:13,622 INFO L87 Difference]: Start difference. First operand 883 states and 3273 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:13,929 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 04:30:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:14,205 INFO L93 Difference]: Finished difference Result 922 states and 3391 transitions. [2021-06-05 04:30:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:14,207 INFO L225 Difference]: With dead ends: 922 [2021-06-05 04:30:14,207 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 04:30:14,207 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 764.5ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 04:30:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 881. [2021-06-05 04:30:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7113636363636364) internal successors, (3266), 880 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3266 transitions. [2021-06-05 04:30:14,217 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3266 transitions. Word has length 18 [2021-06-05 04:30:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:14,217 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3266 transitions. [2021-06-05 04:30:14,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3266 transitions. [2021-06-05 04:30:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:14,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:14,218 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:14,418 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3997,339 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:14,418 INFO L430 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2046888246, now seen corresponding path program 193 times [2021-06-05 04:30:14,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:14,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611708412] [2021-06-05 04:30:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:14,775 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 04:30:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:15,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:15,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611708412] [2021-06-05 04:30:15,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611708412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:15,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169125054] [2021-06-05 04:30:15,171 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:15,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:15,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:15,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:15,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:15,309 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:15,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:15,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:15,361 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:15,361 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:30:15,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:15,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:15,545 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:15,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:15,548 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:15,551 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:15,589 INFO L628 ElimStorePlain]: treesize reduction 67, result has 40.7 percent of original size [2021-06-05 04:30:15,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:15,592 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:15,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:15,608 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:15,608 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 04:30:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:15,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169125054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:15,677 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:15,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:30:15,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067854505] [2021-06-05 04:30:15,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:30:15,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:30:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:30:15,678 INFO L87 Difference]: Start difference. First operand 881 states and 3266 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:16,170 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 04:30:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:16,582 INFO L93 Difference]: Finished difference Result 935 states and 3409 transitions. [2021-06-05 04:30:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:30:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:16,584 INFO L225 Difference]: With dead ends: 935 [2021-06-05 04:30:16,584 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 04:30:16,585 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1500.8ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:30:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 04:30:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 882. [2021-06-05 04:30:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 3.7116912599318956) internal successors, (3270), 881 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 3270 transitions. [2021-06-05 04:30:16,594 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 3270 transitions. Word has length 18 [2021-06-05 04:30:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:16,594 INFO L482 AbstractCegarLoop]: Abstraction has 882 states and 3270 transitions. [2021-06-05 04:30:16,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 3270 transitions. [2021-06-05 04:30:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:16,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:16,596 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:16,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 340 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4023 [2021-06-05 04:30:16,796 INFO L430 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1569373752, now seen corresponding path program 194 times [2021-06-05 04:30:16,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:16,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188099001] [2021-06-05 04:30:16,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:17,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:17,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188099001] [2021-06-05 04:30:17,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188099001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:17,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806051718] [2021-06-05 04:30:17,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:17,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:17,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:17,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:17,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:17,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:17,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:17,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:17,672 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:17,675 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:17,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:17,722 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:30:17,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:17,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:17,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:17,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:17,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:17,877 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:17,934 INFO L628 ElimStorePlain]: treesize reduction 83, result has 41.1 percent of original size [2021-06-05 04:30:17,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:17,938 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:17,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:17,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:17,961 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:30:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:18,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806051718] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:18,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:18,080 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:30:18,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109030153] [2021-06-05 04:30:18,080 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:30:18,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:18,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:30:18,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:30:18,080 INFO L87 Difference]: Start difference. First operand 882 states and 3270 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:18,339 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2021-06-05 04:30:18,622 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2021-06-05 04:30:18,823 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 04:30:19,028 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2021-06-05 04:30:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:19,248 INFO L93 Difference]: Finished difference Result 928 states and 3397 transitions. [2021-06-05 04:30:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:19,250 INFO L225 Difference]: With dead ends: 928 [2021-06-05 04:30:19,250 INFO L226 Difference]: Without dead ends: 916 [2021-06-05 04:30:19,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1738.0ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:30:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-06-05 04:30:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 884. [2021-06-05 04:30:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.712344280860702) internal successors, (3278), 883 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3278 transitions. [2021-06-05 04:30:19,260 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3278 transitions. Word has length 18 [2021-06-05 04:30:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:19,261 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3278 transitions. [2021-06-05 04:30:19,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3278 transitions. [2021-06-05 04:30:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:19,262 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:19,262 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:19,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4037,341 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:19,462 INFO L430 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 550929662, now seen corresponding path program 195 times [2021-06-05 04:30:19,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:19,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904464686] [2021-06-05 04:30:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:19,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:19,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904464686] [2021-06-05 04:30:19,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904464686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:19,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434216673] [2021-06-05 04:30:19,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:19,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:30:19,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:19,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:19,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:19,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:19,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:19,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:19,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:19,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:19,914 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:19,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:19,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:19,917 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:19,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:19,920 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:19,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:19,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:19,954 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 04:30:20,107 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_940], 1=[array_4, v_prenex_941]} [2021-06-05 04:30:20,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:20,111 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:20,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:20,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:20,154 INFO L628 ElimStorePlain]: treesize reduction 81, result has 38.2 percent of original size [2021-06-05 04:30:20,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:20,157 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:20,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:20,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:20,174 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:20,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:20,188 INFO L518 ElimStorePlain]: Eliminatee v_prenex_941 vanished before elimination [2021-06-05 04:30:20,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:20,189 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:30:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:20,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434216673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:20,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:20,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:20,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263167600] [2021-06-05 04:30:20,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:20,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:20,254 INFO L87 Difference]: Start difference. First operand 884 states and 3278 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:20,644 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 04:30:20,955 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 04:30:21,151 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-06-05 04:30:21,348 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-06-05 04:30:21,511 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 04:30:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:21,582 INFO L93 Difference]: Finished difference Result 1071 states and 3832 transitions. [2021-06-05 04:30:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:21,584 INFO L225 Difference]: With dead ends: 1071 [2021-06-05 04:30:21,584 INFO L226 Difference]: Without dead ends: 1061 [2021-06-05 04:30:21,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1485.3ms TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-06-05 04:30:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 886. [2021-06-05 04:30:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7084745762711866) internal successors, (3282), 885 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3282 transitions. [2021-06-05 04:30:21,594 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3282 transitions. Word has length 18 [2021-06-05 04:30:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:21,594 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3282 transitions. [2021-06-05 04:30:21,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3282 transitions. [2021-06-05 04:30:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:21,595 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:21,595 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:21,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4051,342 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:21,796 INFO L430 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1825878340, now seen corresponding path program 196 times [2021-06-05 04:30:21,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:21,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661046643] [2021-06-05 04:30:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:22,182 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-06-05 04:30:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:22,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:22,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661046643] [2021-06-05 04:30:22,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661046643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:22,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130339992] [2021-06-05 04:30:22,455 INFO L93 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 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:22,481 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:22,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:22,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:22,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:22,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:22,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:22,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:22,570 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:22,573 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,596 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:22,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:22,597 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 04:30:22,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:22,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:22,745 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:22,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:22,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:22,751 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:22,787 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 04:30:22,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:22,790 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:22,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:22,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:22,805 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:30:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:22,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130339992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:22,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:22,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:30:22,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359669863] [2021-06-05 04:30:22,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:30:22,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:30:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:22,881 INFO L87 Difference]: Start difference. First operand 886 states and 3282 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:23,310 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 04:30:23,545 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 04:30:23,936 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-06-05 04:30:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:24,478 INFO L93 Difference]: Finished difference Result 996 states and 3571 transitions. [2021-06-05 04:30:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:30:24,478 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:24,480 INFO L225 Difference]: With dead ends: 996 [2021-06-05 04:30:24,480 INFO L226 Difference]: Without dead ends: 987 [2021-06-05 04:30:24,480 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1827.7ms TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:30:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-06-05 04:30:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 885. [2021-06-05 04:30:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 3.7104072398190047) internal successors, (3280), 884 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3280 transitions. [2021-06-05 04:30:24,490 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3280 transitions. Word has length 18 [2021-06-05 04:30:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:24,490 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 3280 transitions. [2021-06-05 04:30:24,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3280 transitions. [2021-06-05 04:30:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:24,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:24,491 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:24,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 343 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4066 [2021-06-05 04:30:24,692 INFO L430 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash -543054878, now seen corresponding path program 197 times [2021-06-05 04:30:24,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:24,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028417591] [2021-06-05 04:30:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:24,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:24,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028417591] [2021-06-05 04:30:24,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028417591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:24,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673155540] [2021-06-05 04:30:24,985 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:25,012 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:30:25,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:25,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:25,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:25,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:25,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:25,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:25,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:25,111 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:25,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:25,147 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 04:30:25,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:25,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:25,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:25,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:25,269 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:25,272 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,308 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 04:30:25,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:25,310 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:25,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:25,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:25,324 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:30:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:25,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673155540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:25,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:25,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:25,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086607046] [2021-06-05 04:30:25,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:25,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:25,388 INFO L87 Difference]: Start difference. First operand 885 states and 3280 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:25,931 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 04:30:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:26,280 INFO L93 Difference]: Finished difference Result 936 states and 3421 transitions. [2021-06-05 04:30:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:30:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:26,282 INFO L225 Difference]: With dead ends: 936 [2021-06-05 04:30:26,282 INFO L226 Difference]: Without dead ends: 931 [2021-06-05 04:30:26,282 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 988.3ms TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-06-05 04:30:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 883. [2021-06-05 04:30:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 04:30:26,291 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 04:30:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:26,292 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 04:30:26,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 04:30:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:26,293 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:26,293 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:26,493 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4080,344 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:26,493 INFO L430 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:26,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1647567582, now seen corresponding path program 198 times [2021-06-05 04:30:26,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:26,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812106483] [2021-06-05 04:30:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:30:26,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:26,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812106483] [2021-06-05 04:30:26,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812106483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:26,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396405744] [2021-06-05 04:30:26,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:26,566 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:30:26,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:26,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:30:26,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:26,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:30:26,590 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:26,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:26,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:26,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:26,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:30:26,616 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:26,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:26,628 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:26,628 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:30:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:30:26,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396405744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:26,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:26,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 04:30:26,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382874260] [2021-06-05 04:30:26,703 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:30:26,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:30:26,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:30:26,703 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:27,253 INFO L93 Difference]: Finished difference Result 1362 states and 4657 transitions. [2021-06-05 04:30:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:30:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:27,255 INFO L225 Difference]: With dead ends: 1362 [2021-06-05 04:30:27,255 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 04:30:27,255 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 489.5ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:30:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 04:30:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 950. [2021-06-05 04:30:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 04:30:27,267 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 04:30:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:27,267 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 04:30:27,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 04:30:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:27,269 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:27,269 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:27,469 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 345 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4095 [2021-06-05 04:30:27,469 INFO L430 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2349128, now seen corresponding path program 199 times [2021-06-05 04:30:27,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:27,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158189533] [2021-06-05 04:30:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:27,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:27,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158189533] [2021-06-05 04:30:27,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158189533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:27,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324042062] [2021-06-05 04:30:27,723 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:27,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:27,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:27,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:27,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:27,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:27,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:27,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:27,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:27,834 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:27,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:27,856 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:27,856 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:59 [2021-06-05 04:30:28,044 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 04:30:28,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:28,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:28,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:28,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:28,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:28,052 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:28,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:28,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:28,056 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:28,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:28,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:28,108 INFO L628 ElimStorePlain]: treesize reduction 79, result has 44.8 percent of original size [2021-06-05 04:30:28,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:28,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:28,111 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:28,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:28,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:28,132 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:38 [2021-06-05 04:30:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:28,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324042062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:28,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:28,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 04:30:28,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357217086] [2021-06-05 04:30:28,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:30:28,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:30:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:28,193 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:28,941 INFO L93 Difference]: Finished difference Result 1072 states and 3951 transitions. [2021-06-05 04:30:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:28,943 INFO L225 Difference]: With dead ends: 1072 [2021-06-05 04:30:28,943 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 04:30:28,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 820.9ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:30:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 04:30:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 955. [2021-06-05 04:30:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.7788259958071277) internal successors, (3605), 954 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3605 transitions. [2021-06-05 04:30:28,954 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 3605 transitions. Word has length 18 [2021-06-05 04:30:28,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:28,954 INFO L482 AbstractCegarLoop]: Abstraction has 955 states and 3605 transitions. [2021-06-05 04:30:28,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 3605 transitions. [2021-06-05 04:30:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:28,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:28,956 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:29,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4103,346 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:29,156 INFO L430 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash 858845074, now seen corresponding path program 200 times [2021-06-05 04:30:29,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:29,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834092840] [2021-06-05 04:30:29,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:29,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:29,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834092840] [2021-06-05 04:30:29,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834092840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:29,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516566993] [2021-06-05 04:30:29,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:29,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:29,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:29,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:29,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:29,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:29,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:29,536 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:29,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:29,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:29,539 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:29,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:29,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:29,560 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 04:30:29,738 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_947, array_2], 1=[v_prenex_948, array_4]} [2021-06-05 04:30:29,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:29,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:29,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:29,745 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:29,778 INFO L628 ElimStorePlain]: treesize reduction 59, result has 44.3 percent of original size [2021-06-05 04:30:29,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:30:29,780 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:29,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:29,791 INFO L518 ElimStorePlain]: Eliminatee v_prenex_948 vanished before elimination [2021-06-05 04:30:29,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:29,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:29,794 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:29,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:29,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:29,805 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 04:30:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:29,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516566993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:29,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:29,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 04:30:29,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196373881] [2021-06-05 04:30:29,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:29,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:29,833 INFO L87 Difference]: Start difference. First operand 955 states and 3605 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:30,460 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-05 04:30:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:30,827 INFO L93 Difference]: Finished difference Result 1084 states and 3991 transitions. [2021-06-05 04:30:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:30:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:30,830 INFO L225 Difference]: With dead ends: 1084 [2021-06-05 04:30:30,830 INFO L226 Difference]: Without dead ends: 1074 [2021-06-05 04:30:30,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 993.0ms TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2021-06-05 04:30:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 950. [2021-06-05 04:30:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 04:30:30,841 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 04:30:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:30,841 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 04:30:30,841 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 04:30:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:30,842 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:30,842 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:31,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4115,347 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:31,043 INFO L430 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1946717226, now seen corresponding path program 201 times [2021-06-05 04:30:31,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:31,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143388472] [2021-06-05 04:30:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:31,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:31,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143388472] [2021-06-05 04:30:31,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143388472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:31,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631935840] [2021-06-05 04:30:31,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:31,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:30:31,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:31,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:31,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:31,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:31,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:31,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:31,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:31,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:31,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:31,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:31,401 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:72 [2021-06-05 04:30:31,538 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_951], 1=[array_4, v_prenex_952]} [2021-06-05 04:30:31,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:31,542 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:31,545 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,578 INFO L628 ElimStorePlain]: treesize reduction 61, result has 44.5 percent of original size [2021-06-05 04:30:31,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:31,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:31,591 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:30:31,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:31,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:31,594 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:31,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:31,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:31,605 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 04:30:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:31,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631935840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:31,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:31,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:30:31,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264446571] [2021-06-05 04:30:31,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:30:31,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:30:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:30:31,629 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:32,039 INFO L93 Difference]: Finished difference Result 1011 states and 3762 transitions. [2021-06-05 04:30:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:32,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:32,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:32,041 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 04:30:32,041 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 04:30:32,041 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 484.7ms TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:30:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 04:30:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 956. [2021-06-05 04:30:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 3.781151832460733) internal successors, (3611), 955 states have internal predecessors, (3611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 3611 transitions. [2021-06-05 04:30:32,052 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 3611 transitions. Word has length 18 [2021-06-05 04:30:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:32,052 INFO L482 AbstractCegarLoop]: Abstraction has 956 states and 3611 transitions. [2021-06-05 04:30:32,052 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 3611 transitions. [2021-06-05 04:30:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:32,053 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:32,053 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:32,254 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4130,348 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:32,254 INFO L430 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:32,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 408261324, now seen corresponding path program 202 times [2021-06-05 04:30:32,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:32,254 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331811337] [2021-06-05 04:30:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:32,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:32,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331811337] [2021-06-05 04:30:32,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331811337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:32,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671351226] [2021-06-05 04:30:32,487 INFO L93 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 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:32,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:32,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:32,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:32,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:32,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:32,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:32,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:32,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:32,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:32,648 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 04:30:32,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:32,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:32,714 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:32,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:32,718 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:32,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:32,721 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:32,724 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:32,779 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 04:30:32,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:32,782 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:32,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:32,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:32,806 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:30:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:32,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671351226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:32,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:32,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 04:30:32,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900402825] [2021-06-05 04:30:32,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:30:32,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:30:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:32,908 INFO L87 Difference]: Start difference. First operand 956 states and 3611 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:33,398 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-06-05 04:30:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:33,727 INFO L93 Difference]: Finished difference Result 1021 states and 3787 transitions. [2021-06-05 04:30:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:33,730 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 04:30:33,730 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 04:30:33,730 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 880.9ms TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 04:30:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 953. [2021-06-05 04:30:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 3.7804621848739495) internal successors, (3599), 952 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 3599 transitions. [2021-06-05 04:30:33,740 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 3599 transitions. Word has length 18 [2021-06-05 04:30:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:33,740 INFO L482 AbstractCegarLoop]: Abstraction has 953 states and 3599 transitions. [2021-06-05 04:30:33,740 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 3599 transitions. [2021-06-05 04:30:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:33,742 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:33,742 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:33,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 349 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4144 [2021-06-05 04:30:33,943 INFO L430 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -465479356, now seen corresponding path program 203 times [2021-06-05 04:30:33,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:33,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348489140] [2021-06-05 04:30:33,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:34,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:34,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348489140] [2021-06-05 04:30:34,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348489140] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:34,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400434894] [2021-06-05 04:30:34,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:34,224 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:30:34,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:34,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:34,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:34,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:34,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:34,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:34,350 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:34,350 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 04:30:34,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:34,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:34,409 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:34,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:34,412 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:34,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:34,415 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:34,418 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,454 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:30:34,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:34,457 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:34,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:34,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:34,471 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:30:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:34,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400434894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:34,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:34,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:34,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703361159] [2021-06-05 04:30:34,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:34,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:34,531 INFO L87 Difference]: Start difference. First operand 953 states and 3599 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:35,290 INFO L93 Difference]: Finished difference Result 1019 states and 3793 transitions. [2021-06-05 04:30:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:35,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:35,292 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 04:30:35,293 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 04:30:35,293 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 830.6ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:30:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 04:30:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 950. [2021-06-05 04:30:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 04:30:35,303 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 04:30:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:35,303 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 04:30:35,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 04:30:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:35,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:35,305 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:35,505 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 350 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4155 [2021-06-05 04:30:35,505 INFO L430 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:35,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:35,505 INFO L82 PathProgramCache]: Analyzing trace with hash -786313054, now seen corresponding path program 204 times [2021-06-05 04:30:35,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:35,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961626852] [2021-06-05 04:30:35,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:30:35,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:35,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961626852] [2021-06-05 04:30:35,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961626852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:35,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518083745] [2021-06-05 04:30:35,573 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:35,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:30:35,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:35,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:30:35,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:35,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:30:35,625 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:35,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:35,627 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:35,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:35,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:30:35,642 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:35,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:35,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:35,654 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:30:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:30:35,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518083745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:35,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:35,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 04:30:35,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509501611] [2021-06-05 04:30:35,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 04:30:35,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 04:30:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 04:30:35,741 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:36,359 INFO L93 Difference]: Finished difference Result 1682 states and 5831 transitions. [2021-06-05 04:30:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:30:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:36,362 INFO L225 Difference]: With dead ends: 1682 [2021-06-05 04:30:36,362 INFO L226 Difference]: Without dead ends: 1571 [2021-06-05 04:30:36,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 554.0ms TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:30:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2021-06-05 04:30:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 932. [2021-06-05 04:30:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 04:30:36,378 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 04:30:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:36,378 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 04:30:36,378 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 04:30:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:36,379 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:36,379 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:36,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 351 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4165 [2021-06-05 04:30:36,579 INFO L430 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash 436630378, now seen corresponding path program 205 times [2021-06-05 04:30:36,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:36,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867920180] [2021-06-05 04:30:36,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:36,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:36,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867920180] [2021-06-05 04:30:36,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867920180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:36,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851274570] [2021-06-05 04:30:36,755 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:36,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:36,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:36,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:36,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:36,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:36,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:36,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:36,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:36,915 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:36,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:36,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:36,953 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:90 [2021-06-05 04:30:37,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:37,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:37,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:37,188 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:37,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:37,193 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:37,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:37,198 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:37,258 INFO L628 ElimStorePlain]: treesize reduction 99, result has 42.8 percent of original size [2021-06-05 04:30:37,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:37,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:37,263 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:37,288 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:37,289 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:37,290 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:44 [2021-06-05 04:30:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:37,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851274570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:37,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:37,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:30:37,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956401197] [2021-06-05 04:30:37,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:37,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:37,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:37,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:37,353 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:37,684 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-05 04:30:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:37,741 INFO L93 Difference]: Finished difference Result 979 states and 3632 transitions. [2021-06-05 04:30:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:37,743 INFO L225 Difference]: With dead ends: 979 [2021-06-05 04:30:37,743 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 04:30:37,744 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 535.9ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:30:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 04:30:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 938. [2021-06-05 04:30:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 04:30:37,754 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 04:30:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:37,754 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 04:30:37,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 04:30:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:37,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:37,755 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:37,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4174,352 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:37,956 INFO L430 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1503358368, now seen corresponding path program 206 times [2021-06-05 04:30:37,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:37,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288394752] [2021-06-05 04:30:37,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:38,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:38,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288394752] [2021-06-05 04:30:38,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288394752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:38,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735203275] [2021-06-05 04:30:38,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:38,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:38,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:38,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:38,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:38,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:38,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:38,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:38,288 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:38,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:38,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:38,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 04:30:38,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:38,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:38,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:38,404 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:38,469 INFO L628 ElimStorePlain]: treesize reduction 100, result has 42.9 percent of original size [2021-06-05 04:30:38,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:38,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:38,474 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:38,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:38,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:38,500 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:38,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:38,521 INFO L518 ElimStorePlain]: Eliminatee v_prenex_962 vanished before elimination [2021-06-05 04:30:38,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:38,522 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:76 [2021-06-05 04:30:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:38,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735203275] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:38,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:38,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:30:38,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737287274] [2021-06-05 04:30:38,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:38,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:38,606 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:38,978 INFO L93 Difference]: Finished difference Result 981 states and 3649 transitions. [2021-06-05 04:30:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:38,980 INFO L225 Difference]: With dead ends: 981 [2021-06-05 04:30:38,980 INFO L226 Difference]: Without dead ends: 976 [2021-06-05 04:30:38,980 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 375.9ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-06-05 04:30:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 935. [2021-06-05 04:30:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 3.7655246252676657) internal successors, (3517), 934 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 3517 transitions. [2021-06-05 04:30:38,990 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 3517 transitions. Word has length 18 [2021-06-05 04:30:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:38,991 INFO L482 AbstractCegarLoop]: Abstraction has 935 states and 3517 transitions. [2021-06-05 04:30:38,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 3517 transitions. [2021-06-05 04:30:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:38,992 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:38,992 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:39,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4190,353 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:39,192 INFO L430 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1917868248, now seen corresponding path program 207 times [2021-06-05 04:30:39,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:39,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501507545] [2021-06-05 04:30:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:39,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:39,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501507545] [2021-06-05 04:30:39,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501507545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:39,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338427749] [2021-06-05 04:30:39,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:39,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:30:39,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:39,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:39,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:39,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:39,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:39,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:39,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:39,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:39,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:39,603 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:89 [2021-06-05 04:30:39,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:39,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:39,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:39,737 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:39,811 INFO L628 ElimStorePlain]: treesize reduction 103, result has 44.3 percent of original size [2021-06-05 04:30:39,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:39,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:39,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:39,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:39,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:39,843 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:39,867 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:39,867 INFO L518 ElimStorePlain]: Eliminatee v_prenex_964 vanished before elimination [2021-06-05 04:30:39,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:39,868 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:199, output treesize:35 [2021-06-05 04:30:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:39,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338427749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:39,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:39,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 04:30:39,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154414346] [2021-06-05 04:30:39,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:30:39,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:30:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:39,921 INFO L87 Difference]: Start difference. First operand 935 states and 3517 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:40,545 INFO L93 Difference]: Finished difference Result 994 states and 3674 transitions. [2021-06-05 04:30:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:30:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:40,547 INFO L225 Difference]: With dead ends: 994 [2021-06-05 04:30:40,547 INFO L226 Difference]: Without dead ends: 989 [2021-06-05 04:30:40,548 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 602.1ms TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:30:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-06-05 04:30:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 938. [2021-06-05 04:30:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7662753468516543) internal successors, (3529), 937 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3529 transitions. [2021-06-05 04:30:40,558 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3529 transitions. Word has length 18 [2021-06-05 04:30:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:40,558 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3529 transitions. [2021-06-05 04:30:40,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3529 transitions. [2021-06-05 04:30:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:40,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:40,559 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:40,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4209,354 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:40,760 INFO L430 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 246892232, now seen corresponding path program 208 times [2021-06-05 04:30:40,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:40,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194152472] [2021-06-05 04:30:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:40,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:40,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194152472] [2021-06-05 04:30:40,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194152472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:40,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496969007] [2021-06-05 04:30:40,971 INFO L93 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 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:40,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:40,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:40,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:40,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:41,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:41,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:41,129 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:41,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:41,168 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:99 [2021-06-05 04:30:41,297 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 04:30:41,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:41,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:41,307 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:41,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:41,317 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,370 INFO L628 ElimStorePlain]: treesize reduction 98, result has 44.0 percent of original size [2021-06-05 04:30:41,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:41,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:41,374 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:41,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:41,398 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:41,398 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:199, output treesize:79 [2021-06-05 04:30:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:41,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496969007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:41,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:41,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 04:30:41,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707652847] [2021-06-05 04:30:41,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:30:41,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:41,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:30:41,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:30:41,485 INFO L87 Difference]: Start difference. First operand 938 states and 3529 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:41,784 INFO L93 Difference]: Finished difference Result 977 states and 3628 transitions. [2021-06-05 04:30:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:41,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:41,786 INFO L225 Difference]: With dead ends: 977 [2021-06-05 04:30:41,786 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 04:30:41,786 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 496.2ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 04:30:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 932. [2021-06-05 04:30:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 04:30:41,796 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 04:30:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:41,796 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 04:30:41,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 04:30:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:41,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:41,798 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:41,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4236,355 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:41,998 INFO L430 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:41,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:41,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1828182638, now seen corresponding path program 209 times [2021-06-05 04:30:41,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:41,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769211292] [2021-06-05 04:30:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:42,302 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:42,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769211292] [2021-06-05 04:30:42,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769211292] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:42,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273932483] [2021-06-05 04:30:42,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:42,328 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:42,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:42,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:42,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:42,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:42,416 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:42,420 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:42,424 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:42,482 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:42,483 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:163 [2021-06-05 04:30:42,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:42,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:42,838 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:42,843 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:42,848 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,909 INFO L628 ElimStorePlain]: treesize reduction 99, result has 44.7 percent of original size [2021-06-05 04:30:42,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:42,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:42,912 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:42,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:42,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:42,939 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:41 [2021-06-05 04:30:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:43,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273932483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:43,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:43,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 04:30:43,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603533835] [2021-06-05 04:30:43,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:43,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:43,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:43,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:43,015 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:43,301 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-06-05 04:30:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:43,533 INFO L93 Difference]: Finished difference Result 984 states and 3645 transitions. [2021-06-05 04:30:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:43,534 INFO L225 Difference]: With dead ends: 984 [2021-06-05 04:30:43,535 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 04:30:43,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 858.7ms TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:30:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 04:30:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 938. [2021-06-05 04:30:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 04:30:43,545 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 04:30:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:43,545 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 04:30:43,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 04:30:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:43,546 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:43,546 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:43,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 356 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4252 [2021-06-05 04:30:43,746 INFO L430 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 526795912, now seen corresponding path program 210 times [2021-06-05 04:30:43,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:43,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034836098] [2021-06-05 04:30:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:43,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:43,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034836098] [2021-06-05 04:30:43,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034836098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:43,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355482631] [2021-06-05 04:30:43,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:44,014 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:30:44,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:44,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:44,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:44,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:44,134 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:44,138 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:44,142 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:44,146 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:44,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:30:44,202 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 04:30:44,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:44,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:44,468 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:44,472 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:44,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,546 INFO L628 ElimStorePlain]: treesize reduction 100, result has 43.5 percent of original size [2021-06-05 04:30:44,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:44,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:44,549 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:44,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:44,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:44,574 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:35 [2021-06-05 04:30:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:44,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355482631] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:44,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:44,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:30:44,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057712725] [2021-06-05 04:30:44,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:44,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:44,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:44,626 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:44,973 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 04:30:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:45,356 INFO L93 Difference]: Finished difference Result 996 states and 3695 transitions. [2021-06-05 04:30:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:45,358 INFO L225 Difference]: With dead ends: 996 [2021-06-05 04:30:45,358 INFO L226 Difference]: Without dead ends: 991 [2021-06-05 04:30:45,358 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 829.0ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-06-05 04:30:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 932. [2021-06-05 04:30:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 04:30:45,368 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 04:30:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:45,368 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 04:30:45,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 04:30:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:45,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:45,370 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:45,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 357 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4265 [2021-06-05 04:30:45,570 INFO L430 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1621089656, now seen corresponding path program 211 times [2021-06-05 04:30:45,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:45,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083985613] [2021-06-05 04:30:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:45,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:45,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083985613] [2021-06-05 04:30:45,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083985613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:45,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975063901] [2021-06-05 04:30:45,885 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:45,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:45,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:45,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:45,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:45,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:46,003 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:46,006 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:46,010 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:46,062 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:46,062 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:30:46,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:46,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:46,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:46,217 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:46,221 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,284 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 04:30:46,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:46,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:46,288 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:46,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:46,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:46,315 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:185, output treesize:56 [2021-06-05 04:30:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:46,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975063901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:46,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:46,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:30:46,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402448020] [2021-06-05 04:30:46,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:46,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:46,456 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:46,862 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-06-05 04:30:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:47,082 INFO L93 Difference]: Finished difference Result 988 states and 3667 transitions. [2021-06-05 04:30:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:47,082 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:47,084 INFO L225 Difference]: With dead ends: 988 [2021-06-05 04:30:47,084 INFO L226 Difference]: Without dead ends: 975 [2021-06-05 04:30:47,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 918.5ms TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:30:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-06-05 04:30:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 932. [2021-06-05 04:30:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 04:30:47,094 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 04:30:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:47,094 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 04:30:47,094 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 04:30:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:47,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:47,095 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:47,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 358 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4294 [2021-06-05 04:30:47,296 INFO L430 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash -584456886, now seen corresponding path program 212 times [2021-06-05 04:30:47,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:47,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602293696] [2021-06-05 04:30:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:30:47,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:47,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602293696] [2021-06-05 04:30:47,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602293696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:47,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989058259] [2021-06-05 04:30:47,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:47,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:47,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:47,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:30:47,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:47,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:47,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:47,422 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:47,425 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:47,427 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:47,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:47,452 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 04:30:47,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:30:47,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:47,552 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:47,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:47,555 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:47,558 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:47,587 INFO L628 ElimStorePlain]: treesize reduction 56, result has 38.5 percent of original size [2021-06-05 04:30:47,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:30:47,590 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:47,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:47,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:47,602 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:115, output treesize:27 [2021-06-05 04:30:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:47,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989058259] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:47,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:47,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:30:47,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874295340] [2021-06-05 04:30:47,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:47,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:47,629 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:48,679 INFO L93 Difference]: Finished difference Result 1418 states and 4919 transitions. [2021-06-05 04:30:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 04:30:48,679 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:48,681 INFO L225 Difference]: With dead ends: 1418 [2021-06-05 04:30:48,681 INFO L226 Difference]: Without dead ends: 1269 [2021-06-05 04:30:48,681 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 898.0ms TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2021-06-05 04:30:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2021-06-05 04:30:48,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 878. [2021-06-05 04:30:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 04:30:48,693 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 04:30:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:48,693 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 04:30:48,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 04:30:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:48,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:48,694 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:48,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 359 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4308 [2021-06-05 04:30:48,895 INFO L430 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1994899952, now seen corresponding path program 213 times [2021-06-05 04:30:48,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:48,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348929126] [2021-06-05 04:30:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:49,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:49,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348929126] [2021-06-05 04:30:49,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348929126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:49,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025343374] [2021-06-05 04:30:49,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:49,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:30:49,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:49,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:49,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:49,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:49,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:49,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:49,573 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:49,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:49,576 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:49,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:49,580 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:49,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:49,584 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:49,587 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:49,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:30:49,632 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:135 [2021-06-05 04:30:49,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:49,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:30:49,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:49,765 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:30:49,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:49,767 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:49,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:49,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:49,773 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:30:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:49,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025343374] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:49,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:49,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:30:49,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528523990] [2021-06-05 04:30:49,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:30:49,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:30:49,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:30:49,803 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:50,370 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2021-06-05 04:30:50,547 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-06-05 04:30:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:50,713 INFO L93 Difference]: Finished difference Result 924 states and 3403 transitions. [2021-06-05 04:30:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:50,715 INFO L225 Difference]: With dead ends: 924 [2021-06-05 04:30:50,715 INFO L226 Difference]: Without dead ends: 919 [2021-06-05 04:30:50,715 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1236.1ms TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:30:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-06-05 04:30:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 878. [2021-06-05 04:30:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 04:30:50,724 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 04:30:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:50,724 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 04:30:50,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 04:30:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:50,725 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:50,726 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:50,926 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4319,360 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:50,926 INFO L430 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1178914066, now seen corresponding path program 214 times [2021-06-05 04:30:50,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:50,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983209748] [2021-06-05 04:30:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:51,326 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 04:30:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:51,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:51,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983209748] [2021-06-05 04:30:51,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983209748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:51,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942789696] [2021-06-05 04:30:51,596 INFO L93 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 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:51,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:30:51,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:51,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:30:51,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:51,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:51,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:51,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:51,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:51,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:51,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:51,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:51,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:51,777 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:51,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:51,781 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:51,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:51,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:51,840 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:30:52,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:52,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:52,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:52,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:52,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:52,025 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:52,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:52,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:52,028 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:52,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:52,031 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:52,069 INFO L628 ElimStorePlain]: treesize reduction 81, result has 36.2 percent of original size [2021-06-05 04:30:52,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:52,072 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:52,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:52,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:52,088 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 04:30:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:52,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942789696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:52,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:52,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:30:52,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377698283] [2021-06-05 04:30:52,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:30:52,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:30:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:30:52,160 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:52,778 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 04:30:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:53,297 INFO L93 Difference]: Finished difference Result 989 states and 3591 transitions. [2021-06-05 04:30:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:30:53,297 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:53,299 INFO L225 Difference]: With dead ends: 989 [2021-06-05 04:30:53,299 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 04:30:53,299 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1507.2ms TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:30:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 04:30:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 878. [2021-06-05 04:30:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 04:30:53,309 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 04:30:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:53,309 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 04:30:53,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 04:30:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:53,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:53,310 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:53,511 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4333,361 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:53,511 INFO L430 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1253312526, now seen corresponding path program 215 times [2021-06-05 04:30:53,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:53,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63596768] [2021-06-05 04:30:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:53,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:53,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63596768] [2021-06-05 04:30:53,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63596768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:53,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280499732] [2021-06-05 04:30:53,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:53,748 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:53,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:53,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:53,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:53,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:53,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:53,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:53,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:53,874 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:53,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:53,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:53,908 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 04:30:54,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:54,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:54,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:54,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:54,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:54,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:54,125 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:54,174 INFO L628 ElimStorePlain]: treesize reduction 77, result has 44.2 percent of original size [2021-06-05 04:30:54,174 INFO L518 ElimStorePlain]: Eliminatee v_prenex_989 vanished before elimination [2021-06-05 04:30:54,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:54,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:30:54,177 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:54,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:54,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:54,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:54,196 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:54,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:54,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:54,212 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:152, output treesize:16 [2021-06-05 04:30:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:54,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280499732] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:54,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:54,227 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:30:54,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057783805] [2021-06-05 04:30:54,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:54,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:54,227 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:54,579 INFO L93 Difference]: Finished difference Result 910 states and 3365 transitions. [2021-06-05 04:30:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:54,581 INFO L225 Difference]: With dead ends: 910 [2021-06-05 04:30:54,581 INFO L226 Difference]: Without dead ends: 905 [2021-06-05 04:30:54,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 431.5ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-06-05 04:30:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 884. [2021-06-05 04:30:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7440543601359004) internal successors, (3306), 883 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3306 transitions. [2021-06-05 04:30:54,590 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3306 transitions. Word has length 18 [2021-06-05 04:30:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:54,590 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3306 transitions. [2021-06-05 04:30:54,590 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3306 transitions. [2021-06-05 04:30:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:54,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:54,592 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:54,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4346,362 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:54,792 INFO L430 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666024, now seen corresponding path program 216 times [2021-06-05 04:30:54,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:54,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017727205] [2021-06-05 04:30:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:54,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:54,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017727205] [2021-06-05 04:30:54,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017727205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:54,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038240034] [2021-06-05 04:30:54,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:55,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:30:55,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:55,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:55,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:55,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:55,127 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:55,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:55,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:30:55,165 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2021-06-05 04:30:55,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:30:55,241 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:55,245 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,320 INFO L628 ElimStorePlain]: treesize reduction 100, result has 44.8 percent of original size [2021-06-05 04:30:55,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:55,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:30:55,324 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:55,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:30:55,348 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:55,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:55,369 INFO L518 ElimStorePlain]: Eliminatee v_prenex_992 vanished before elimination [2021-06-05 04:30:55,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:55,370 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:201, output treesize:76 [2021-06-05 04:30:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:55,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038240034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:55,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:55,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:30:55,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123726836] [2021-06-05 04:30:55,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:30:55,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:30:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:30:55,451 INFO L87 Difference]: Start difference. First operand 884 states and 3306 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:55,690 INFO L93 Difference]: Finished difference Result 920 states and 3397 transitions. [2021-06-05 04:30:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:55,692 INFO L225 Difference]: With dead ends: 920 [2021-06-05 04:30:55,692 INFO L226 Difference]: Without dead ends: 915 [2021-06-05 04:30:55,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 383.5ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:30:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-06-05 04:30:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 881. [2021-06-05 04:30:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.743181818181818) internal successors, (3294), 880 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3294 transitions. [2021-06-05 04:30:55,702 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3294 transitions. Word has length 18 [2021-06-05 04:30:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:55,702 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3294 transitions. [2021-06-05 04:30:55,702 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3294 transitions. [2021-06-05 04:30:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:55,703 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:55,703 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:55,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4368,363 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:55,903 INFO L430 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:55,904 INFO L82 PathProgramCache]: Analyzing trace with hash 227925344, now seen corresponding path program 217 times [2021-06-05 04:30:55,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:55,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734073012] [2021-06-05 04:30:55,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:56,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:56,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734073012] [2021-06-05 04:30:56,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734073012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:56,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855097822] [2021-06-05 04:30:56,132 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:56,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:30:56,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:56,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:56,265 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:56,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:56,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:56,283 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 04:30:56,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:56,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:56,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:56,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:56,334 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:56,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:56,337 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:56,340 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:56,375 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 04:30:56,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:56,378 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:56,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:56,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:56,392 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:30:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:56,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855097822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:56,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:56,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:56,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356506157] [2021-06-05 04:30:56,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:56,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:56,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:56,451 INFO L87 Difference]: Start difference. First operand 881 states and 3294 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:57,082 INFO L93 Difference]: Finished difference Result 915 states and 3387 transitions. [2021-06-05 04:30:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:57,083 INFO L225 Difference]: With dead ends: 915 [2021-06-05 04:30:57,084 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 04:30:57,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 692.3ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:30:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 04:30:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 878. [2021-06-05 04:30:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 04:30:57,093 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 04:30:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:57,093 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 04:30:57,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 04:30:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:57,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:57,095 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:57,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4388,364 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:57,297 INFO L430 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 776841754, now seen corresponding path program 218 times [2021-06-05 04:30:57,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:57,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909290224] [2021-06-05 04:30:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:57,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:57,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909290224] [2021-06-05 04:30:57,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909290224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:57,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022987096] [2021-06-05 04:30:57,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:57,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:30:57,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:57,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:57,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:57,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:57,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:57,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:57,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:57,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:57,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:57,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:57,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:57,703 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:57,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:57,706 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:57,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:57,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:30:57,750 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:30:57,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:57,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:57,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:57,915 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:30:57,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:57,915 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:30:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:57,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022987096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:57,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:57,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:30:57,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538980904] [2021-06-05 04:30:57,942 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:30:57,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:30:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:30:57,942 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:58,398 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 04:30:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:30:58,746 INFO L93 Difference]: Finished difference Result 915 states and 3378 transitions. [2021-06-05 04:30:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:30:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:30:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:30:58,748 INFO L225 Difference]: With dead ends: 915 [2021-06-05 04:30:58,748 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 04:30:58,748 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 961.2ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:30:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 04:30:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 884. [2021-06-05 04:30:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7474518686296716) internal successors, (3309), 883 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3309 transitions. [2021-06-05 04:30:58,758 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3309 transitions. Word has length 18 [2021-06-05 04:30:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:30:58,758 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3309 transitions. [2021-06-05 04:30:58,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:30:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3309 transitions. [2021-06-05 04:30:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:30:58,759 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:30:58,759 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:30:58,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 365 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4398 [2021-06-05 04:30:58,960 INFO L430 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:30:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:30:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1163146992, now seen corresponding path program 219 times [2021-06-05 04:30:58,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:30:58,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527959097] [2021-06-05 04:30:58,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:30:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:30:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:59,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:30:59,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527959097] [2021-06-05 04:30:59,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527959097] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:59,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530452269] [2021-06-05 04:30:59,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:30:59,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:30:59,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:30:59,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:30:59,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:30:59,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:30:59,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:30:59,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:59,406 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:59,410 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:59,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:30:59,459 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:167, output treesize:131 [2021-06-05 04:30:59,615 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 04:30:59,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:30:59,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:30:59,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:30:59,627 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:30:59,630 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:30:59,674 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 04:30:59,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:30:59,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:30:59,678 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:30:59,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:30:59,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:30:59,698 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 04:30:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:30:59,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530452269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:30:59,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:30:59,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:30:59,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188872799] [2021-06-05 04:30:59,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:30:59,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:30:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:30:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:30:59,760 INFO L87 Difference]: Start difference. First operand 884 states and 3309 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:00,158 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2021-06-05 04:31:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:00,438 INFO L93 Difference]: Finished difference Result 931 states and 3434 transitions. [2021-06-05 04:31:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:00,440 INFO L225 Difference]: With dead ends: 931 [2021-06-05 04:31:00,440 INFO L226 Difference]: Without dead ends: 926 [2021-06-05 04:31:00,440 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 818.3ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-06-05 04:31:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 878. [2021-06-05 04:31:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 04:31:00,450 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 04:31:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:00,450 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 04:31:00,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 04:31:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:00,451 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:00,451 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:00,651 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4412,366 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:00,651 INFO L430 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:00,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash 983934736, now seen corresponding path program 220 times [2021-06-05 04:31:00,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:00,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205342242] [2021-06-05 04:31:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:00,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:00,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205342242] [2021-06-05 04:31:00,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205342242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:00,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129662492] [2021-06-05 04:31:00,902 INFO L93 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 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:00,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:31:00,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:00,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:00,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:01,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:01,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:01,006 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:01,010 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:01,014 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:01,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:01,075 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:181 [2021-06-05 04:31:01,323 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 04:31:01,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:01,328 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:01,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:01,338 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:01,342 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:01,426 INFO L628 ElimStorePlain]: treesize reduction 108, result has 43.5 percent of original size [2021-06-05 04:31:01,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:01,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:01,430 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:01,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:01,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:01,462 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:223, output treesize:90 [2021-06-05 04:31:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:01,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129662492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:01,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:01,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:31:01,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854519010] [2021-06-05 04:31:01,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:01,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:01,629 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:01,876 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-06-05 04:31:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:02,055 INFO L93 Difference]: Finished difference Result 919 states and 3396 transitions. [2021-06-05 04:31:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:02,057 INFO L225 Difference]: With dead ends: 919 [2021-06-05 04:31:02,057 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 04:31:02,057 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 805.0ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:31:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 04:31:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 880. [2021-06-05 04:31:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 04:31:02,066 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 04:31:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:02,066 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 04:31:02,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 04:31:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:02,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:02,067 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:02,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4438,367 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:02,268 INFO L430 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 333942614, now seen corresponding path program 221 times [2021-06-05 04:31:02,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:02,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476205565] [2021-06-05 04:31:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:02,676 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 04:31:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:03,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:03,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476205565] [2021-06-05 04:31:03,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476205565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:03,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526036930] [2021-06-05 04:31:03,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:03,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:31:03,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:03,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:03,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:03,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:03,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:03,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:03,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:03,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:03,221 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:03,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:03,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:03,224 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:03,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:03,227 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:03,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:03,272 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:03,273 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:31:03,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:03,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:03,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:03,447 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:03,447 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:03,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:31:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:03,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526036930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:03,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:03,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:31:03,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94246614] [2021-06-05 04:31:03,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:31:03,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:31:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:31:03,480 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:04,059 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 04:31:04,301 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-06-05 04:31:04,590 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-06-05 04:31:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:04,678 INFO L93 Difference]: Finished difference Result 916 states and 3382 transitions. [2021-06-05 04:31:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:04,679 INFO L225 Difference]: With dead ends: 916 [2021-06-05 04:31:04,679 INFO L226 Difference]: Without dead ends: 911 [2021-06-05 04:31:04,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1810.1ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:31:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-06-05 04:31:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 884. [2021-06-05 04:31:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7497168742921856) internal successors, (3311), 883 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3311 transitions. [2021-06-05 04:31:04,689 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3311 transitions. Word has length 18 [2021-06-05 04:31:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:04,689 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3311 transitions. [2021-06-05 04:31:04,689 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3311 transitions. [2021-06-05 04:31:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:04,690 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:04,690 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:04,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 368 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4460 [2021-06-05 04:31:04,891 INFO L430 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1606046132, now seen corresponding path program 222 times [2021-06-05 04:31:04,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:04,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060527308] [2021-06-05 04:31:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:05,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:05,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060527308] [2021-06-05 04:31:05,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060527308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:05,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383390784] [2021-06-05 04:31:05,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:05,374 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:31:05,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:05,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:05,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:05,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:05,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:05,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:05,480 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:05,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:05,501 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:05,505 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:05,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:05,552 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:31:05,682 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1001], 1=[array_4, v_prenex_1002]} [2021-06-05 04:31:05,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:05,686 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:31:05,689 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,728 INFO L628 ElimStorePlain]: treesize reduction 81, result has 38.2 percent of original size [2021-06-05 04:31:05,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:05,731 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:05,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:05,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:05,748 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:05,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:05,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1002 vanished before elimination [2021-06-05 04:31:05,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:05,762 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:31:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:05,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383390784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:05,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:05,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:31:05,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561492869] [2021-06-05 04:31:05,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:31:05,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:05,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:31:05,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:31:05,827 INFO L87 Difference]: Start difference. First operand 884 states and 3311 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:06,297 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 04:31:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:06,627 INFO L93 Difference]: Finished difference Result 939 states and 3443 transitions. [2021-06-05 04:31:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:06,629 INFO L225 Difference]: With dead ends: 939 [2021-06-05 04:31:06,629 INFO L226 Difference]: Without dead ends: 934 [2021-06-05 04:31:06,629 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1066.0ms TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:31:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-06-05 04:31:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 880. [2021-06-05 04:31:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 04:31:06,640 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 04:31:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:06,640 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 04:31:06,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 04:31:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:06,642 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:06,642 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:06,860 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 369 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4474 [2021-06-05 04:31:06,861 INFO L430 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash -407491060, now seen corresponding path program 223 times [2021-06-05 04:31:06,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:06,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905885005] [2021-06-05 04:31:06,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:07,362 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 04:31:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:07,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:07,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905885005] [2021-06-05 04:31:07,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905885005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:07,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874984230] [2021-06-05 04:31:07,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:07,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:07,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:07,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:07,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:07,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:07,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:07,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:07,846 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:07,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:07,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:07,850 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:07,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:07,853 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:07,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:07,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:07,898 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:31:08,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:08,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:08,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:08,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:08,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:31:08,104 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:08,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:08,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:08,107 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:08,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:08,110 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:08,149 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 04:31:08,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:08,152 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:08,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:08,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:08,168 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 04:31:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:08,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874984230] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:08,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:08,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:31:08,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514630345] [2021-06-05 04:31:08,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:31:08,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:08,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:31:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:31:08,243 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:08,821 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 04:31:09,122 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 70 [2021-06-05 04:31:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:09,365 INFO L93 Difference]: Finished difference Result 913 states and 3367 transitions. [2021-06-05 04:31:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:31:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:09,367 INFO L225 Difference]: With dead ends: 913 [2021-06-05 04:31:09,367 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 04:31:09,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1785.8ms TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:31:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 04:31:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 881. [2021-06-05 04:31:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 04:31:09,376 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 04:31:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:09,376 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 04:31:09,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 04:31:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:09,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:09,378 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:09,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4489,370 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:09,578 INFO L430 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -913837326, now seen corresponding path program 224 times [2021-06-05 04:31:09,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:09,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864638269] [2021-06-05 04:31:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:09,969 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2021-06-05 04:31:10,106 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2021-06-05 04:31:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:10,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:10,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864638269] [2021-06-05 04:31:10,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864638269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:10,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665096937] [2021-06-05 04:31:10,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:10,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:31:10,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:10,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:10,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:10,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:10,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:10,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:10,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:10,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:10,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:10,514 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:10,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:10,519 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:10,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:10,523 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:10,527 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:10,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:31:10,611 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:135 [2021-06-05 04:31:10,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:10,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:31:10,824 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:10,840 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:31:10,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:10,843 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:10,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:10,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:10,851 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:31:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:10,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665096937] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:10,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:10,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:31:10,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309803214] [2021-06-05 04:31:10,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:31:10,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:31:10,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:31:10,905 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:11,329 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2021-06-05 04:31:11,558 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2021-06-05 04:31:11,885 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 04:31:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:11,968 INFO L93 Difference]: Finished difference Result 909 states and 3358 transitions. [2021-06-05 04:31:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:11,970 INFO L225 Difference]: With dead ends: 909 [2021-06-05 04:31:11,970 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 04:31:11,970 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1614.9ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:31:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 04:31:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 881. [2021-06-05 04:31:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 04:31:11,979 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 04:31:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:11,979 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 04:31:11,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 04:31:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:11,981 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:11,981 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:12,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 371 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4503 [2021-06-05 04:31:12,181 INFO L430 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -344762684, now seen corresponding path program 225 times [2021-06-05 04:31:12,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:12,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979851735] [2021-06-05 04:31:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:12,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:12,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979851735] [2021-06-05 04:31:12,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979851735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:12,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498085028] [2021-06-05 04:31:12,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:13,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:31:13,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:13,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 04:31:13,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:13,181 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:31:13,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 04:31:13,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,189 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:31:13,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 04:31:13,190 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,197 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:31:13,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 04:31:13,198 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,203 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:31:13,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:31:13,204 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,251 INFO L628 ElimStorePlain]: treesize reduction 33, result has 71.3 percent of original size [2021-06-05 04:31:13,252 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:31:13,252 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:78 [2021-06-05 04:31:13,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:13,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:13,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:13,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:13,326 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:13,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:13,330 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:13,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:31:13,335 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:13,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:13,341 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:13,345 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:13,413 INFO L628 ElimStorePlain]: treesize reduction 103, result has 37.6 percent of original size [2021-06-05 04:31:13,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:13,417 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:13,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:13,460 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:31:13,460 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:221, output treesize:54 [2021-06-05 04:31:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:13,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498085028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:13,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:13,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:31:13,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281516301] [2021-06-05 04:31:13,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:31:13,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:31:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:31:13,542 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:14,155 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2021-06-05 04:31:14,387 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2021-06-05 04:31:14,727 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2021-06-05 04:31:14,907 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2021-06-05 04:31:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:14,983 INFO L93 Difference]: Finished difference Result 923 states and 3410 transitions. [2021-06-05 04:31:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:31:14,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:14,985 INFO L225 Difference]: With dead ends: 923 [2021-06-05 04:31:14,985 INFO L226 Difference]: Without dead ends: 918 [2021-06-05 04:31:14,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1902.2ms TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:31:14,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-06-05 04:31:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 879. [2021-06-05 04:31:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 04:31:14,994 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 04:31:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:14,994 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 04:31:14,994 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 04:31:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:14,995 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:14,995 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:15,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4517,372 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:15,196 INFO L430 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1113995740, now seen corresponding path program 226 times [2021-06-05 04:31:15,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:15,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941735439] [2021-06-05 04:31:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:15,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:15,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941735439] [2021-06-05 04:31:15,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941735439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:15,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731900898] [2021-06-05 04:31:15,523 INFO L93 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 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:15,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:31:15,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:15,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:15,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:15,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:15,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:15,640 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:15,644 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:15,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:15,683 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 04:31:15,938 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 04:31:15,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:15,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:15,946 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:15,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:15,950 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:15,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:15,953 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:16,006 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 04:31:16,008 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:16,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:16,010 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:16,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:16,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:16,031 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:38 [2021-06-05 04:31:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:16,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731900898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:16,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:16,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 04:31:16,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393975828] [2021-06-05 04:31:16,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:31:16,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:31:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:31:16,104 INFO L87 Difference]: Start difference. First operand 879 states and 3287 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:16,419 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-06-05 04:31:16,917 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-06-05 04:31:17,097 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-05 04:31:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:17,150 INFO L93 Difference]: Finished difference Result 1188 states and 4247 transitions. [2021-06-05 04:31:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:17,153 INFO L225 Difference]: With dead ends: 1188 [2021-06-05 04:31:17,153 INFO L226 Difference]: Without dead ends: 1169 [2021-06-05 04:31:17,153 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1252.6ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:31:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-06-05 04:31:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 884. [2021-06-05 04:31:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.739524348810872) internal successors, (3302), 883 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3302 transitions. [2021-06-05 04:31:17,165 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3302 transitions. Word has length 18 [2021-06-05 04:31:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:17,165 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3302 transitions. [2021-06-05 04:31:17,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3302 transitions. [2021-06-05 04:31:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:17,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:17,166 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:17,366 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4533,373 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:17,367 INFO L430 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1970491686, now seen corresponding path program 227 times [2021-06-05 04:31:17,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:17,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550508515] [2021-06-05 04:31:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:17,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:17,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550508515] [2021-06-05 04:31:17,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550508515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:17,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694775896] [2021-06-05 04:31:17,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:17,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:31:17,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:17,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:17,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:17,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:17,876 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:17,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:17,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:17,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:17,886 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:17,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:17,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:17,890 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:17,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:17,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:17,939 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:115 [2021-06-05 04:31:18,225 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1008], 1=[v_prenex_1009, array_4]} [2021-06-05 04:31:18,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:18,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:18,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:18,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:18,275 INFO L628 ElimStorePlain]: treesize reduction 61, result has 44.5 percent of original size [2021-06-05 04:31:18,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:18,278 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:18,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:18,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:18,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:31:18,295 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:18,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:18,308 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:18,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:18,309 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 04:31:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:18,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694775896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:18,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:18,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:31:18,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538407847] [2021-06-05 04:31:18,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:18,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:18,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:18,343 INFO L87 Difference]: Start difference. First operand 884 states and 3302 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:18,708 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-06-05 04:31:19,069 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2021-06-05 04:31:19,318 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-05 04:31:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:19,526 INFO L93 Difference]: Finished difference Result 1157 states and 4179 transitions. [2021-06-05 04:31:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:19,528 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 04:31:19,528 INFO L226 Difference]: Without dead ends: 1152 [2021-06-05 04:31:19,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1323.6ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-06-05 04:31:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 887. [2021-06-05 04:31:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.740406320541761) internal successors, (3314), 886 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3314 transitions. [2021-06-05 04:31:19,543 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3314 transitions. Word has length 18 [2021-06-05 04:31:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:19,543 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3314 transitions. [2021-06-05 04:31:19,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3314 transitions. [2021-06-05 04:31:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:19,544 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:19,544 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:19,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 374 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4551 [2021-06-05 04:31:19,745 INFO L430 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash 30502940, now seen corresponding path program 228 times [2021-06-05 04:31:19,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:19,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136490492] [2021-06-05 04:31:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:20,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:20,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136490492] [2021-06-05 04:31:20,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136490492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:20,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021199110] [2021-06-05 04:31:20,102 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:20,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:31:20,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:20,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:20,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:20,237 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:20,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:20,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:20,249 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:20,253 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:20,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:20,296 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:111 [2021-06-05 04:31:20,454 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1010], 1=[v_prenex_1011, array_4]} [2021-06-05 04:31:20,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:20,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:20,461 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,507 INFO L628 ElimStorePlain]: treesize reduction 84, result has 41.3 percent of original size [2021-06-05 04:31:20,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:20,510 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:20,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:20,528 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1011 vanished before elimination [2021-06-05 04:31:20,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:20,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:20,531 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:20,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:20,549 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:20,549 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:161, output treesize:44 [2021-06-05 04:31:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:20,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021199110] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:20,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:20,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:31:20,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968836941] [2021-06-05 04:31:20,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:20,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:20,621 INFO L87 Difference]: Start difference. First operand 887 states and 3314 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:20,936 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 04:31:21,500 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-06-05 04:31:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:21,558 INFO L93 Difference]: Finished difference Result 1178 states and 4230 transitions. [2021-06-05 04:31:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:21,560 INFO L225 Difference]: With dead ends: 1178 [2021-06-05 04:31:21,560 INFO L226 Difference]: Without dead ends: 1173 [2021-06-05 04:31:21,560 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1151.7ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-06-05 04:31:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 879. [2021-06-05 04:31:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 04:31:21,571 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 04:31:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:21,571 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 04:31:21,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 04:31:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:21,572 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:21,573 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:21,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4570,375 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:21,773 INFO L430 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1815060318, now seen corresponding path program 229 times [2021-06-05 04:31:21,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:21,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852008621] [2021-06-05 04:31:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:31:21,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:21,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852008621] [2021-06-05 04:31:21,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852008621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:21,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040881068] [2021-06-05 04:31:21,819 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:21,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:31:21,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:21,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:21,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:21,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:21,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:21,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:21,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:31:21,887 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:21,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:21,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:21,899 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:31:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:31:21,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040881068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:21,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:21,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 04:31:21,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260700264] [2021-06-05 04:31:21,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 04:31:21,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 04:31:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 04:31:21,954 INFO L87 Difference]: Start difference. First operand 879 states and 3287 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:22,525 INFO L93 Difference]: Finished difference Result 1446 states and 4960 transitions. [2021-06-05 04:31:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:31:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:22,534 INFO L225 Difference]: With dead ends: 1446 [2021-06-05 04:31:22,534 INFO L226 Difference]: Without dead ends: 1326 [2021-06-05 04:31:22,534 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 485.8ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:31:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-06-05 04:31:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 894. [2021-06-05 04:31:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 3.753639417693169) internal successors, (3352), 893 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 3352 transitions. [2021-06-05 04:31:22,546 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 3352 transitions. Word has length 18 [2021-06-05 04:31:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:22,546 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 3352 transitions. [2021-06-05 04:31:22,546 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 3352 transitions. [2021-06-05 04:31:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:22,547 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:22,548 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:22,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4587,376 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:22,748 INFO L430 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -395611674, now seen corresponding path program 230 times [2021-06-05 04:31:22,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:22,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854011010] [2021-06-05 04:31:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:23,071 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 04:31:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:23,454 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:23,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854011010] [2021-06-05 04:31:23,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854011010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:23,454 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005755595] [2021-06-05 04:31:23,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:23,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:31:23,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:23,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:23,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:23,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:23,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:23,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:23,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:23,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:23,584 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:23,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:23,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:23,588 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:23,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:23,590 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:23,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:23,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:23,624 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 04:31:23,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:23,813 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:23,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:23,818 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:23,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:23,819 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:31:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:23,851 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005755595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:23,851 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:23,851 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:31:23,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47943309] [2021-06-05 04:31:23,851 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:31:23,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:31:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:31:23,851 INFO L87 Difference]: Start difference. First operand 894 states and 3352 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:24,344 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2021-06-05 04:31:24,588 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2021-06-05 04:31:24,798 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2021-06-05 04:31:25,051 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-06-05 04:31:25,317 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2021-06-05 04:31:25,805 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 04:31:26,022 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2021-06-05 04:31:26,376 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2021-06-05 04:31:26,556 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-06-05 04:31:26,794 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2021-06-05 04:31:27,007 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-06-05 04:31:27,224 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 04:31:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:27,265 INFO L93 Difference]: Finished difference Result 1366 states and 4753 transitions. [2021-06-05 04:31:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:31:27,265 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:27,267 INFO L225 Difference]: With dead ends: 1366 [2021-06-05 04:31:27,267 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 04:31:27,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3571.6ms TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 04:31:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 04:31:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 902. [2021-06-05 04:31:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 04:31:27,280 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 04:31:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:27,280 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 04:31:27,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 04:31:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:27,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:27,281 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:27,481 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 377 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4595 [2021-06-05 04:31:27,481 INFO L430 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:27,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2075094054, now seen corresponding path program 231 times [2021-06-05 04:31:27,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:27,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507180774] [2021-06-05 04:31:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:27,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:27,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507180774] [2021-06-05 04:31:27,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507180774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:27,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003197765] [2021-06-05 04:31:27,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:27,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:31:27,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:27,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:27,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:27,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:27,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:27,983 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:27,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:27,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:27,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:27,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:27,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:27,990 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:27,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:27,992 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:28,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:28,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:28,026 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 04:31:28,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:28,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:28,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:28,231 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:28,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:28,231 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:31:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:28,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003197765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:28,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:28,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:31:28,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576329330] [2021-06-05 04:31:28,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:31:28,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:31:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:31:28,260 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:28,674 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-06-05 04:31:28,958 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-06-05 04:31:29,247 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2021-06-05 04:31:29,472 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2021-06-05 04:31:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:29,711 INFO L93 Difference]: Finished difference Result 1134 states and 4071 transitions. [2021-06-05 04:31:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:31:29,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:29,713 INFO L225 Difference]: With dead ends: 1134 [2021-06-05 04:31:29,714 INFO L226 Difference]: Without dead ends: 1129 [2021-06-05 04:31:29,714 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1646.8ms TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:31:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-06-05 04:31:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 902. [2021-06-05 04:31:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 04:31:29,725 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 04:31:29,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:29,725 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 04:31:29,725 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 04:31:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:29,726 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:29,726 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:29,926 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 378 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4606 [2021-06-05 04:31:29,926 INFO L430 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1216089874, now seen corresponding path program 232 times [2021-06-05 04:31:29,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:29,927 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299963521] [2021-06-05 04:31:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:30,259 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-05 04:31:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:30,337 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:30,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299963521] [2021-06-05 04:31:30,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299963521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:30,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428663523] [2021-06-05 04:31:30,337 INFO L93 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 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:30,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:31:30,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:30,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:30,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:30,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:30,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:30,459 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:30,463 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:30,466 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:30,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:30,507 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:111 [2021-06-05 04:31:30,797 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 04:31:30,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:30,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:30,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:30,809 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:30,813 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:30,860 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 04:31:30,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:30,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:30,864 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:30,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:30,885 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:30,885 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:173, output treesize:41 [2021-06-05 04:31:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:30,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428663523] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:30,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:30,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:31:30,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104893745] [2021-06-05 04:31:30,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:31:30,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:31:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:31:30,962 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:31,280 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 04:31:31,556 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2021-06-05 04:31:31,859 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 04:31:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:32,016 INFO L93 Difference]: Finished difference Result 1112 states and 4026 transitions. [2021-06-05 04:31:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:32,018 INFO L225 Difference]: With dead ends: 1112 [2021-06-05 04:31:32,018 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 04:31:32,018 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1380.3ms TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:31:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 04:31:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 905. [2021-06-05 04:31:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 3.7488938053097347) internal successors, (3389), 904 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3389 transitions. [2021-06-05 04:31:32,029 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3389 transitions. Word has length 18 [2021-06-05 04:31:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:32,029 INFO L482 AbstractCegarLoop]: Abstraction has 905 states and 3389 transitions. [2021-06-05 04:31:32,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3389 transitions. [2021-06-05 04:31:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:32,030 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:32,030 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:32,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4619,379 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:32,231 INFO L430 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:32,231 INFO L82 PathProgramCache]: Analyzing trace with hash -723898872, now seen corresponding path program 233 times [2021-06-05 04:31:32,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:32,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491469983] [2021-06-05 04:31:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:32,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:32,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491469983] [2021-06-05 04:31:32,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491469983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:32,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171307901] [2021-06-05 04:31:32,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:32,565 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:31:32,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:32,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:32,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:32,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:32,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:32,652 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:32,656 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:32,659 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:32,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:32,698 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:31:32,882 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1015], 1=[array_4, v_prenex_1016]} [2021-06-05 04:31:32,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:31:32,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:32,889 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,936 INFO L628 ElimStorePlain]: treesize reduction 91, result has 38.1 percent of original size [2021-06-05 04:31:32,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:32,939 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:32,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:32,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:32,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:32,960 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:32,976 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:32,976 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1016 vanished before elimination [2021-06-05 04:31:32,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:32,977 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 04:31:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:33,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171307901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:33,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:33,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:31:33,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064978736] [2021-06-05 04:31:33,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:33,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:33,049 INFO L87 Difference]: Start difference. First operand 905 states and 3389 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:33,387 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-06-05 04:31:33,638 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2021-06-05 04:31:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:34,116 INFO L93 Difference]: Finished difference Result 1129 states and 4070 transitions. [2021-06-05 04:31:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:34,118 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 04:31:34,118 INFO L226 Difference]: Without dead ends: 1124 [2021-06-05 04:31:34,118 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1209.1ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-06-05 04:31:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 902. [2021-06-05 04:31:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 04:31:34,129 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 04:31:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:34,129 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 04:31:34,129 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 04:31:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:34,130 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:34,130 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:34,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4634,380 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:34,331 INFO L430 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash 474656200, now seen corresponding path program 234 times [2021-06-05 04:31:34,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:34,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105471483] [2021-06-05 04:31:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:34,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:34,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105471483] [2021-06-05 04:31:34,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105471483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:34,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159742730] [2021-06-05 04:31:34,680 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:34,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:31:34,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:34,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:34,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:34,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:34,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:34,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:34,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:34,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:34,798 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:34,800 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:34,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:34,801 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:34,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:34,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:34,840 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 04:31:35,170 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2021-06-05 04:31:35,279 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1023], 1=[array_4, v_prenex_1024]} [2021-06-05 04:31:35,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:35,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:35,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:35,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:35,317 INFO L628 ElimStorePlain]: treesize reduction 67, result has 44.2 percent of original size [2021-06-05 04:31:35,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:35,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:35,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:35,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:35,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:31:35,333 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:35,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:35,343 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1024 vanished before elimination [2021-06-05 04:31:35,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:35,344 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 04:31:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:35,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159742730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:35,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:35,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:31:35,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205670336] [2021-06-05 04:31:35,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:35,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:35,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:35,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:35,373 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:35,735 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 04:31:36,001 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2021-06-05 04:31:36,377 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 116 [2021-06-05 04:31:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:36,676 INFO L93 Difference]: Finished difference Result 1102 states and 4004 transitions. [2021-06-05 04:31:36,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:36,676 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:36,678 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 04:31:36,678 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 04:31:36,678 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1569.1ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 04:31:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 902. [2021-06-05 04:31:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 04:31:36,690 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 04:31:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:36,691 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 04:31:36,691 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 04:31:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:36,692 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:36,692 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:36,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 381 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4650 [2021-06-05 04:31:36,892 INFO L430 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -736738304, now seen corresponding path program 235 times [2021-06-05 04:31:36,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:36,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192474314] [2021-06-05 04:31:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:37,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:37,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192474314] [2021-06-05 04:31:37,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192474314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:37,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294108896] [2021-06-05 04:31:37,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:37,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:31:37,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:37,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:37,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:37,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:37,317 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:37,323 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:37,330 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:37,335 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:37,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:31:37,423 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:171 [2021-06-05 04:31:37,743 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 04:31:37,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:37,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:37,751 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:37,755 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:37,758 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:37,813 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 04:31:37,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:37,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:37,818 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:37,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:37,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:37,839 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:41 [2021-06-05 04:31:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:37,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294108896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:37,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:37,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:31:37,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595647930] [2021-06-05 04:31:37,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:31:37,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:31:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:31:37,922 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:38,506 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2021-06-05 04:31:38,831 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 121 [2021-06-05 04:31:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:39,149 INFO L93 Difference]: Finished difference Result 1106 states and 4003 transitions. [2021-06-05 04:31:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:39,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:39,151 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 04:31:39,151 INFO L226 Difference]: Without dead ends: 1093 [2021-06-05 04:31:39,151 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1409.1ms TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:31:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-06-05 04:31:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 904. [2021-06-05 04:31:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 04:31:39,162 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 04:31:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:39,162 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 04:31:39,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 04:31:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:39,163 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:39,163 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:39,363 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4676,382 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:39,363 INFO L430 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1451444872, now seen corresponding path program 236 times [2021-06-05 04:31:39,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:39,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942561129] [2021-06-05 04:31:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:39,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:39,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942561129] [2021-06-05 04:31:39,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942561129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:39,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662416595] [2021-06-05 04:31:39,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:39,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:31:39,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:39,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:39,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:40,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:40,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:40,020 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,022 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:40,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:40,023 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:40,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:40,027 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:40,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:40,030 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:40,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:40,034 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:40,037 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:40,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:31:40,081 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 04:31:40,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:40,210 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:40,215 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:40,215 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:40,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:40,216 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:31:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:40,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662416595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:40,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:40,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:31:40,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911287687] [2021-06-05 04:31:40,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:31:40,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:40,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:31:40,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:31:40,246 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:40,826 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2021-06-05 04:31:41,073 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 04:31:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:41,343 INFO L93 Difference]: Finished difference Result 1073 states and 3938 transitions. [2021-06-05 04:31:41,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:41,343 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:41,345 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 04:31:41,345 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 04:31:41,345 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1435.8ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:31:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 04:31:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 904. [2021-06-05 04:31:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 04:31:41,356 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 04:31:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:41,356 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 04:31:41,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 04:31:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:41,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:41,357 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:41,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 383 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4692 [2021-06-05 04:31:41,558 INFO L430 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash 330291594, now seen corresponding path program 237 times [2021-06-05 04:31:41,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:41,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459374599] [2021-06-05 04:31:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:41,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:41,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459374599] [2021-06-05 04:31:41,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459374599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:41,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857454001] [2021-06-05 04:31:41,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:41,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:31:41,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:41,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:31:41,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:42,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,037 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:42,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:42,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:42,046 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:42,050 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,107 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:42,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:42,109 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:167 [2021-06-05 04:31:42,367 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1032], 1=[v_prenex_1033, array_4]} [2021-06-05 04:31:42,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:42,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:42,374 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,407 INFO L628 ElimStorePlain]: treesize reduction 65, result has 43.0 percent of original size [2021-06-05 04:31:42,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:31:42,410 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:42,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:42,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:31:42,423 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:42,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:42,433 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:42,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:42,434 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 04:31:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:42,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857454001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:42,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:42,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:31:42,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092221082] [2021-06-05 04:31:42,462 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:31:42,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:42,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:31:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:31:42,462 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:42,946 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 04:31:43,256 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-06-05 04:31:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:43,388 INFO L93 Difference]: Finished difference Result 1073 states and 3943 transitions. [2021-06-05 04:31:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:43,390 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 04:31:43,390 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 04:31:43,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1162.3ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:31:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 04:31:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 907. [2021-06-05 04:31:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.748344370860927) internal successors, (3396), 906 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 3396 transitions. [2021-06-05 04:31:43,401 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 3396 transitions. Word has length 18 [2021-06-05 04:31:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:43,401 INFO L482 AbstractCegarLoop]: Abstraction has 907 states and 3396 transitions. [2021-06-05 04:31:43,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 3396 transitions. [2021-06-05 04:31:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:43,402 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:43,402 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:43,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 384 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4706 [2021-06-05 04:31:43,603 INFO L430 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1609697152, now seen corresponding path program 238 times [2021-06-05 04:31:43,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:43,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375574709] [2021-06-05 04:31:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:44,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:44,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375574709] [2021-06-05 04:31:44,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375574709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:44,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978800041] [2021-06-05 04:31:44,244 INFO L93 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 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:44,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:31:44,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:44,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:31:44,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:44,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:44,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:44,414 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:44,418 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:44,421 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:44,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:44,474 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:149 [2021-06-05 04:31:44,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:44,621 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:44,624 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:44,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:31:44,628 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:44,631 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,685 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.4 percent of original size [2021-06-05 04:31:44,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:31:44,688 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:44,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:44,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:44,711 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 04:31:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:44,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978800041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:44,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:44,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 04:31:44,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194224035] [2021-06-05 04:31:44,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:31:44,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:31:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:31:44,838 INFO L87 Difference]: Start difference. First operand 907 states and 3396 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:45,275 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2021-06-05 04:31:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:46,004 INFO L93 Difference]: Finished difference Result 1109 states and 4032 transitions. [2021-06-05 04:31:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:31:46,004 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:46,006 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 04:31:46,006 INFO L226 Difference]: Without dead ends: 1092 [2021-06-05 04:31:46,006 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1658.4ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:31:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-06-05 04:31:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 908. [2021-06-05 04:31:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 3.7497243660418964) internal successors, (3401), 907 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 3401 transitions. [2021-06-05 04:31:46,017 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 3401 transitions. Word has length 18 [2021-06-05 04:31:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:46,017 INFO L482 AbstractCegarLoop]: Abstraction has 908 states and 3401 transitions. [2021-06-05 04:31:46,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 3401 transitions. [2021-06-05 04:31:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:46,019 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:46,019 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:46,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4724,385 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:46,221 INFO L430 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash -317781726, now seen corresponding path program 239 times [2021-06-05 04:31:46,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:46,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124752145] [2021-06-05 04:31:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:31:46,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:46,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124752145] [2021-06-05 04:31:46,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124752145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:46,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556966710] [2021-06-05 04:31:46,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:46,281 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:31:46,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:46,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 04:31:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:46,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:46,313 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:46,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:46,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:46,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:46,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:31:46,331 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:46,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:46,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:46,343 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:31:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:31:46,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556966710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:46,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:46,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 04:31:46,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372650615] [2021-06-05 04:31:46,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 04:31:46,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 04:31:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 04:31:46,377 INFO L87 Difference]: Start difference. First operand 908 states and 3401 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:46,543 INFO L93 Difference]: Finished difference Result 1155 states and 4246 transitions. [2021-06-05 04:31:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 04:31:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:46,545 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 04:31:46,545 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 04:31:46,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 123.2ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:31:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 04:31:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 836. [2021-06-05 04:31:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.7664670658682633) internal successors, (3145), 835 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 3145 transitions. [2021-06-05 04:31:46,555 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 3145 transitions. Word has length 18 [2021-06-05 04:31:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:46,555 INFO L482 AbstractCegarLoop]: Abstraction has 836 states and 3145 transitions. [2021-06-05 04:31:46,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 3145 transitions. [2021-06-05 04:31:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:46,556 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:46,556 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:46,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 386 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4737 [2021-06-05 04:31:46,756 INFO L430 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:46,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1445800362, now seen corresponding path program 240 times [2021-06-05 04:31:46,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:46,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334974691] [2021-06-05 04:31:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:47,277 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:47,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334974691] [2021-06-05 04:31:47,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334974691] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:47,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937221681] [2021-06-05 04:31:47,277 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:47,305 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:31:47,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:47,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:47,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:47,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:47,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:47,441 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:47,444 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:47,448 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:47,451 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:47,455 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:47,458 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:47,462 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:47,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:47,465 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:47,469 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,552 INFO L628 ElimStorePlain]: treesize reduction 92, result has 57.2 percent of original size [2021-06-05 04:31:47,553 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:31:47,553 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:305, output treesize:123 [2021-06-05 04:31:47,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:47,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:31:47,737 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:47,749 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:31:47,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:47,751 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:47,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:47,758 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:47,758 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:31:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:47,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937221681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:47,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:47,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:31:47,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310073744] [2021-06-05 04:31:47,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:31:47,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:31:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:31:47,790 INFO L87 Difference]: Start difference. First operand 836 states and 3145 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:48,430 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 72 [2021-06-05 04:31:48,959 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-06-05 04:31:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:49,293 INFO L93 Difference]: Finished difference Result 1024 states and 3736 transitions. [2021-06-05 04:31:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:31:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:49,295 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 04:31:49,295 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 04:31:49,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1869.7ms TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:31:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 04:31:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 831. [2021-06-05 04:31:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 3.7771084337349397) internal successors, (3135), 830 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 3135 transitions. [2021-06-05 04:31:49,307 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 3135 transitions. Word has length 18 [2021-06-05 04:31:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:49,307 INFO L482 AbstractCegarLoop]: Abstraction has 831 states and 3135 transitions. [2021-06-05 04:31:49,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 3135 transitions. [2021-06-05 04:31:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:49,308 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:49,308 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:49,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4743,387 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:49,509 INFO L430 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -894215328, now seen corresponding path program 241 times [2021-06-05 04:31:49,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:49,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599301431] [2021-06-05 04:31:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:49,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:49,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599301431] [2021-06-05 04:31:49,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599301431] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:49,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854381328] [2021-06-05 04:31:49,574 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:49,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:31:49,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:49,725 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1035, v_prenex_1034, v_prenex_1037, v_prenex_1036], 1=[array_0]} [2021-06-05 04:31:49,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:49,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,768 INFO L628 ElimStorePlain]: treesize reduction 49, result has 59.5 percent of original size [2021-06-05 04:31:49,768 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1034 vanished before elimination [2021-06-05 04:31:49,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:49,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,795 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:49,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:49,798 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:49,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:49,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:49,816 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:49,831 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 04:31:49,831 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:45 [2021-06-05 04:31:49,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:49,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:49,894 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:49,897 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:49,901 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:31:49,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:49,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:31:49,907 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:49,910 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:31:49,913 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:31:49,916 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:49,953 INFO L628 ElimStorePlain]: treesize reduction 55, result has 39.6 percent of original size [2021-06-05 04:31:49,953 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:31:49,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:49,955 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:161, output treesize:30 [2021-06-05 04:31:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:49,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854381328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:49,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:49,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:31:49,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928149003] [2021-06-05 04:31:49,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:31:49,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:31:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:31:49,987 INFO L87 Difference]: Start difference. First operand 831 states and 3135 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:50,589 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-06-05 04:31:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:51,934 INFO L93 Difference]: Finished difference Result 1097 states and 3888 transitions. [2021-06-05 04:31:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 04:31:51,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:51,936 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 04:31:51,936 INFO L226 Difference]: Without dead ends: 1044 [2021-06-05 04:31:51,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1588.8ms TimeCoverageRelationStatistics Valid=451, Invalid=1901, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 04:31:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-06-05 04:31:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 848. [2021-06-05 04:31:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 3.728453364817001) internal successors, (3158), 847 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 3158 transitions. [2021-06-05 04:31:51,947 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 3158 transitions. Word has length 18 [2021-06-05 04:31:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:51,947 INFO L482 AbstractCegarLoop]: Abstraction has 848 states and 3158 transitions. [2021-06-05 04:31:51,947 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 3158 transitions. [2021-06-05 04:31:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:51,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:51,948 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:52,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4755,388 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:52,148 INFO L430 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1989681178, now seen corresponding path program 242 times [2021-06-05 04:31:52,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:52,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385267013] [2021-06-05 04:31:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:52,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:52,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385267013] [2021-06-05 04:31:52,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385267013] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:52,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076822593] [2021-06-05 04:31:52,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:52,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:31:52,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:52,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:31:52,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:52,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:31:52,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:31:52,661 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:52,666 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:31:52,670 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:52,674 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:52,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:52,678 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:52,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:31:52,750 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:171 [2021-06-05 04:31:52,951 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1043], 1=[v_prenex_1044, array_4]} [2021-06-05 04:31:52,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:31:52,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:52,957 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:52,991 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 04:31:52,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:52,994 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:53,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:53,004 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1044 vanished before elimination [2021-06-05 04:31:53,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:53,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:31:53,007 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:53,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:53,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:53,018 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 04:31:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:53,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076822593] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:53,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:53,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 04:31:53,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805061104] [2021-06-05 04:31:53,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:31:53,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:53,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:31:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:31:53,048 INFO L87 Difference]: Start difference. First operand 848 states and 3158 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:53,797 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2021-06-05 04:31:54,246 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 111 [2021-06-05 04:31:54,550 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2021-06-05 04:31:54,769 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2021-06-05 04:31:54,973 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2021-06-05 04:31:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:55,659 INFO L93 Difference]: Finished difference Result 1045 states and 3810 transitions. [2021-06-05 04:31:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:31:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:55,661 INFO L225 Difference]: With dead ends: 1045 [2021-06-05 04:31:55,661 INFO L226 Difference]: Without dead ends: 1026 [2021-06-05 04:31:55,661 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2456.0ms TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 04:31:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-06-05 04:31:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 847. [2021-06-05 04:31:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 3.730496453900709) internal successors, (3156), 846 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3156 transitions. [2021-06-05 04:31:55,671 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3156 transitions. Word has length 18 [2021-06-05 04:31:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:55,671 INFO L482 AbstractCegarLoop]: Abstraction has 847 states and 3156 transitions. [2021-06-05 04:31:55,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3156 transitions. [2021-06-05 04:31:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:55,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:55,672 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:55,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 389 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4770 [2021-06-05 04:31:55,873 INFO L430 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 879584916, now seen corresponding path program 243 times [2021-06-05 04:31:55,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:55,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231730493] [2021-06-05 04:31:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:55,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:55,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231730493] [2021-06-05 04:31:55,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231730493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:55,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175741768] [2021-06-05 04:31:55,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:55,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:31:55,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:55,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 04:31:55,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:56,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:56,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:56,037 INFO L628 ElimStorePlain]: treesize reduction 1, result has 97.2 percent of original size [2021-06-05 04:31:56,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:31:56,040 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:56,050 INFO L628 ElimStorePlain]: treesize reduction 15, result has 44.4 percent of original size [2021-06-05 04:31:56,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:31:56,050 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:12 [2021-06-05 04:31:56,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:56,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:56,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:56,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:56,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:56,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:31:56,090 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:56,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:56,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:31:56,102 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:31:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:56,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175741768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:56,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:56,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 04:31:56,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144442481] [2021-06-05 04:31:56,157 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:31:56,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:31:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:31:56,157 INFO L87 Difference]: Start difference. First operand 847 states and 3156 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:31:57,533 INFO L93 Difference]: Finished difference Result 1612 states and 5528 transitions. [2021-06-05 04:31:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 04:31:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:31:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:31:57,535 INFO L225 Difference]: With dead ends: 1612 [2021-06-05 04:31:57,535 INFO L226 Difference]: Without dead ends: 1481 [2021-06-05 04:31:57,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1072.1ms TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 04:31:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-06-05 04:31:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 922. [2021-06-05 04:31:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.807817589576547) internal successors, (3507), 921 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3507 transitions. [2021-06-05 04:31:57,550 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3507 transitions. Word has length 18 [2021-06-05 04:31:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:31:57,550 INFO L482 AbstractCegarLoop]: Abstraction has 922 states and 3507 transitions. [2021-06-05 04:31:57,550 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:31:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3507 transitions. [2021-06-05 04:31:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:31:57,551 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:31:57,551 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:31:57,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 390 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4793 [2021-06-05 04:31:57,751 INFO L430 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:31:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:31:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1052832608, now seen corresponding path program 244 times [2021-06-05 04:31:57,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:31:57,752 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909419415] [2021-06-05 04:31:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:31:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:31:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:31:57,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:31:57,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909419415] [2021-06-05 04:31:57,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909419415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:57,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823689641] [2021-06-05 04:31:57,794 INFO L93 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 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:31:57,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:31:57,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:31:57,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:31:57,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:31:57,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:57,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:31:57,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,899 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:31:57,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:31:57,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:31:57,903 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:57,906 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:31:57,908 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,910 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:31:57,911 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:57,943 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 04:31:57,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:31:57,944 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 04:31:57,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:31:58,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:31:58,003 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 04:31:58,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:31:58,005 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:58,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:31:58,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:31:58,006 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 04:31:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:31:58,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823689641] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:31:58,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:31:58,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:31:58,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208898036] [2021-06-05 04:31:58,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:31:58,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:31:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:31:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:31:58,014 INFO L87 Difference]: Start difference. First operand 922 states and 3507 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:00,069 INFO L93 Difference]: Finished difference Result 1987 states and 7216 transitions. [2021-06-05 04:32:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 04:32:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:00,072 INFO L225 Difference]: With dead ends: 1987 [2021-06-05 04:32:00,072 INFO L226 Difference]: Without dead ends: 1809 [2021-06-05 04:32:00,072 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1432.0ms TimeCoverageRelationStatistics Valid=676, Invalid=2864, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 04:32:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2021-06-05 04:32:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1021. [2021-06-05 04:32:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.91078431372549) internal successors, (3989), 1020 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 3989 transitions. [2021-06-05 04:32:00,088 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 3989 transitions. Word has length 18 [2021-06-05 04:32:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:00,088 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 3989 transitions. [2021-06-05 04:32:00,088 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 3989 transitions. [2021-06-05 04:32:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:00,090 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:00,090 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:00,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4800,391 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:00,290 INFO L430 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1207604144, now seen corresponding path program 245 times [2021-06-05 04:32:00,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:00,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545557678] [2021-06-05 04:32:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:00,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:00,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545557678] [2021-06-05 04:32:00,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545557678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:00,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078026046] [2021-06-05 04:32:00,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:00,380 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:32:00,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:00,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 04:32:00,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:00,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:00,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:00,413 INFO L628 ElimStorePlain]: treesize reduction 1, result has 95.0 percent of original size [2021-06-05 04:32:00,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:32:00,415 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:00,419 INFO L628 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2021-06-05 04:32:00,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:32:00,419 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2021-06-05 04:32:00,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:00,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:00,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:00,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:00,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:00,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:00,465 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:00,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:00,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:00,477 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 04:32:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:00,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078026046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:00,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:00,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 04:32:00,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862879333] [2021-06-05 04:32:00,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:00,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:00,534 INFO L87 Difference]: Start difference. First operand 1021 states and 3989 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:01,702 INFO L93 Difference]: Finished difference Result 1795 states and 6714 transitions. [2021-06-05 04:32:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 04:32:01,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:01,705 INFO L225 Difference]: With dead ends: 1795 [2021-06-05 04:32:01,705 INFO L226 Difference]: Without dead ends: 1708 [2021-06-05 04:32:01,705 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 893.7ms TimeCoverageRelationStatistics Valid=473, Invalid=2283, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 04:32:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2021-06-05 04:32:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1070. [2021-06-05 04:32:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 3.9747427502338635) internal successors, (4249), 1069 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 4249 transitions. [2021-06-05 04:32:01,722 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 4249 transitions. Word has length 18 [2021-06-05 04:32:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:01,722 INFO L482 AbstractCegarLoop]: Abstraction has 1070 states and 4249 transitions. [2021-06-05 04:32:01,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 4249 transitions. [2021-06-05 04:32:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:01,723 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:01,723 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:01,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4810,392 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:01,924 INFO L430 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash 960983972, now seen corresponding path program 246 times [2021-06-05 04:32:01,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:01,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243347543] [2021-06-05 04:32:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:01,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:01,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243347543] [2021-06-05 04:32:01,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243347543] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:01,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150015754] [2021-06-05 04:32:01,990 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:02,017 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:32:02,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:02,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:02,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:02,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:02,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:32:02,110 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:02,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:02,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:02,113 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:32:02,116 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:02,119 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:02,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:02,122 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,160 INFO L628 ElimStorePlain]: treesize reduction 22, result has 66.7 percent of original size [2021-06-05 04:32:02,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 04:32:02,161 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:119, output treesize:38 [2021-06-05 04:32:02,248 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1048, v_prenex_1047], 1=[array_0, array_2]} [2021-06-05 04:32:02,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:02,252 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:02,281 INFO L628 ElimStorePlain]: treesize reduction 52, result has 42.2 percent of original size [2021-06-05 04:32:02,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:02,284 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:02,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:02,295 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 04:32:02,295 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:32:02,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:02,296 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:30 [2021-06-05 04:32:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:02,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150015754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:02,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:02,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:32:02,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881681999] [2021-06-05 04:32:02,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:32:02,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:02,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:32:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:32:02,332 INFO L87 Difference]: Start difference. First operand 1070 states and 4249 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:03,605 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 04:32:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:04,514 INFO L93 Difference]: Finished difference Result 1513 states and 5765 transitions. [2021-06-05 04:32:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 04:32:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:04,517 INFO L225 Difference]: With dead ends: 1513 [2021-06-05 04:32:04,517 INFO L226 Difference]: Without dead ends: 1482 [2021-06-05 04:32:04,517 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1695.5ms TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 04:32:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2021-06-05 04:32:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1071. [2021-06-05 04:32:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 3.9598130841121497) internal successors, (4237), 1070 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 4237 transitions. [2021-06-05 04:32:04,530 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 4237 transitions. Word has length 18 [2021-06-05 04:32:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:04,530 INFO L482 AbstractCegarLoop]: Abstraction has 1071 states and 4237 transitions. [2021-06-05 04:32:04,530 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 4237 transitions. [2021-06-05 04:32:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:04,532 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:04,532 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:04,732 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4816,393 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:04,732 INFO L430 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1134231664, now seen corresponding path program 247 times [2021-06-05 04:32:04,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:04,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623509947] [2021-06-05 04:32:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:32:04,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:04,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623509947] [2021-06-05 04:32:04,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623509947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:04,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897037716] [2021-06-05 04:32:04,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:04,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:04,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:04,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:32:04,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:04,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:04,862 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,863 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:04,864 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:04,866 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:04,869 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,894 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 04:32:04,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:04,895 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 04:32:04,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:04,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:04,972 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 04:32:04,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:04,974 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:04,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:04,975 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:04,975 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 04:32:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:04,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897037716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:04,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:04,987 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:32:04,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132317828] [2021-06-05 04:32:04,987 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:04,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:04,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:04,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:04,987 INFO L87 Difference]: Start difference. First operand 1071 states and 4237 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:06,109 INFO L93 Difference]: Finished difference Result 1440 states and 5539 transitions. [2021-06-05 04:32:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 04:32:06,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:06,111 INFO L225 Difference]: With dead ends: 1440 [2021-06-05 04:32:06,111 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 04:32:06,111 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 720.3ms TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 04:32:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 04:32:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1057. [2021-06-05 04:32:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 3.949810606060606) internal successors, (4171), 1056 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4171 transitions. [2021-06-05 04:32:06,124 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4171 transitions. Word has length 18 [2021-06-05 04:32:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:06,124 INFO L482 AbstractCegarLoop]: Abstraction has 1057 states and 4171 transitions. [2021-06-05 04:32:06,125 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4171 transitions. [2021-06-05 04:32:06,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:06,126 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:06,126 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:06,326 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4831,394 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:06,326 INFO L430 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1136857440, now seen corresponding path program 248 times [2021-06-05 04:32:06,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:06,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23881581] [2021-06-05 04:32:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:32:06,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:06,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23881581] [2021-06-05 04:32:06,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23881581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:06,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087038207] [2021-06-05 04:32:06,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:06,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:06,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:06,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:06,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:06,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:06,446 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:32:06,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:06,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:06,452 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,454 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:06,455 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:06,457 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:06,459 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,485 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 04:32:06,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:06,486 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 04:32:06,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:06,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:06,551 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 04:32:06,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:06,553 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:06,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:06,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:06,555 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 04:32:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:06,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087038207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:06,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:06,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:32:06,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819901968] [2021-06-05 04:32:06,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:06,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:06,562 INFO L87 Difference]: Start difference. First operand 1057 states and 4171 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:07,701 INFO L93 Difference]: Finished difference Result 1648 states and 6288 transitions. [2021-06-05 04:32:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 04:32:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:07,704 INFO L225 Difference]: With dead ends: 1648 [2021-06-05 04:32:07,704 INFO L226 Difference]: Without dead ends: 1599 [2021-06-05 04:32:07,704 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 748.4ms TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 04:32:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2021-06-05 04:32:07,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1037. [2021-06-05 04:32:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 3.948841698841699) internal successors, (4091), 1036 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 4091 transitions. [2021-06-05 04:32:07,718 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 4091 transitions. Word has length 18 [2021-06-05 04:32:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:07,718 INFO L482 AbstractCegarLoop]: Abstraction has 1037 states and 4091 transitions. [2021-06-05 04:32:07,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 4091 transitions. [2021-06-05 04:32:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:07,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:07,720 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:07,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4841,395 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:07,920 INFO L430 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash -905881326, now seen corresponding path program 249 times [2021-06-05 04:32:07,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:07,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036402833] [2021-06-05 04:32:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:07,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:07,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036402833] [2021-06-05 04:32:07,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036402833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:07,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719385646] [2021-06-05 04:32:07,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:07,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:32:07,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:07,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:07,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:08,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:08,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:08,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:08,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:08,067 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:08,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:08,071 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:08,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:08,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:08,102 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 04:32:08,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:08,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:08,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:08,198 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:08,200 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,203 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:08,203 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:08,206 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,208 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:08,208 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,210 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:08,211 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:08,213 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:08,239 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 04:32:08,239 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:08,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:08,240 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 04:32:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:08,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719385646] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:08,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:08,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:32:08,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693000434] [2021-06-05 04:32:08,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:08,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:08,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:08,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:08,275 INFO L87 Difference]: Start difference. First operand 1037 states and 4091 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:08,837 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-06-05 04:32:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:09,242 INFO L93 Difference]: Finished difference Result 1732 states and 6384 transitions. [2021-06-05 04:32:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 04:32:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:09,245 INFO L225 Difference]: With dead ends: 1732 [2021-06-05 04:32:09,245 INFO L226 Difference]: Without dead ends: 1643 [2021-06-05 04:32:09,245 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 809.9ms TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 04:32:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-06-05 04:32:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1066. [2021-06-05 04:32:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 4.016901408450704) internal successors, (4278), 1065 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 4278 transitions. [2021-06-05 04:32:09,260 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 4278 transitions. Word has length 18 [2021-06-05 04:32:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:09,260 INFO L482 AbstractCegarLoop]: Abstraction has 1066 states and 4278 transitions. [2021-06-05 04:32:09,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 4278 transitions. [2021-06-05 04:32:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:09,262 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:09,262 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:09,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4850,396 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:09,462 INFO L430 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:09,462 INFO L82 PathProgramCache]: Analyzing trace with hash -614645920, now seen corresponding path program 250 times [2021-06-05 04:32:09,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:09,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247689247] [2021-06-05 04:32:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:09,507 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:09,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247689247] [2021-06-05 04:32:09,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247689247] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:09,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970455716] [2021-06-05 04:32:09,507 INFO L93 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 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:09,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:32:09,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:09,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:09,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:09,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:09,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:09,612 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:09,615 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:09,626 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:09,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:09,660 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 04:32:09,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:09,723 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:09,727 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:09,730 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:32:09,734 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:09,737 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:09,741 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:09,744 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:09,747 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:09,806 INFO L628 ElimStorePlain]: treesize reduction 106, result has 38.7 percent of original size [2021-06-05 04:32:09,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:09,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:09,810 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:09,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:09,813 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:09,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:09,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:09,837 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:253, output treesize:55 [2021-06-05 04:32:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:09,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970455716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:09,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:09,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:32:09,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757384805] [2021-06-05 04:32:09,922 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:09,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:09,922 INFO L87 Difference]: Start difference. First operand 1066 states and 4278 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:11,222 INFO L93 Difference]: Finished difference Result 1823 states and 6671 transitions. [2021-06-05 04:32:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 04:32:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:11,225 INFO L225 Difference]: With dead ends: 1823 [2021-06-05 04:32:11,225 INFO L226 Difference]: Without dead ends: 1753 [2021-06-05 04:32:11,225 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1085.3ms TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 04:32:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2021-06-05 04:32:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 965. [2021-06-05 04:32:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 3.9325726141078836) internal successors, (3791), 964 states have internal predecessors, (3791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 3791 transitions. [2021-06-05 04:32:11,241 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 3791 transitions. Word has length 18 [2021-06-05 04:32:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:11,241 INFO L482 AbstractCegarLoop]: Abstraction has 965 states and 3791 transitions. [2021-06-05 04:32:11,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 3791 transitions. [2021-06-05 04:32:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:11,242 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:11,242 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:11,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 397 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4862 [2021-06-05 04:32:11,443 INFO L430 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1844903270, now seen corresponding path program 251 times [2021-06-05 04:32:11,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:11,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107123570] [2021-06-05 04:32:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:11,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:11,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107123570] [2021-06-05 04:32:11,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107123570] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:11,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148196807] [2021-06-05 04:32:11,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:11,837 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:32:11,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:11,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:11,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:11,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:11,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:11,995 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:11,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:11,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:11,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:12,000 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:12,004 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:12,008 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:12,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:32:12,056 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:181, output treesize:151 [2021-06-05 04:32:12,183 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 04:32:12,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:12,188 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:32:12,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:12,197 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:12,202 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:12,206 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:32:12,211 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:12,216 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:12,220 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:12,356 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 04:32:12,357 INFO L628 ElimStorePlain]: treesize reduction 138, result has 52.9 percent of original size [2021-06-05 04:32:12,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,361 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:12,362 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:12,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:12,367 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:12,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:12,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:12,371 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:12,425 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:12,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:32:12,427 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:373, output treesize:97 [2021-06-05 04:32:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:12,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148196807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:12,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:12,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 04:32:12,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23661371] [2021-06-05 04:32:12,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:12,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:12,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:12,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:12,562 INFO L87 Difference]: Start difference. First operand 965 states and 3791 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:13,289 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2021-06-05 04:32:13,421 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 04:32:13,659 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2021-06-05 04:32:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:14,120 INFO L93 Difference]: Finished difference Result 1236 states and 4759 transitions. [2021-06-05 04:32:14,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:32:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:14,123 INFO L225 Difference]: With dead ends: 1236 [2021-06-05 04:32:14,123 INFO L226 Difference]: Without dead ends: 1231 [2021-06-05 04:32:14,123 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1549.2ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:32:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-06-05 04:32:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 969. [2021-06-05 04:32:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9328512396694215) internal successors, (3807), 968 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3807 transitions. [2021-06-05 04:32:14,135 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3807 transitions. Word has length 18 [2021-06-05 04:32:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:14,135 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3807 transitions. [2021-06-05 04:32:14,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3807 transitions. [2021-06-05 04:32:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:14,136 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:14,136 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:14,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4875,398 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:14,337 INFO L430 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1839906778, now seen corresponding path program 252 times [2021-06-05 04:32:14,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:14,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885292379] [2021-06-05 04:32:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:14,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:14,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885292379] [2021-06-05 04:32:14,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885292379] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:14,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359573204] [2021-06-05 04:32:14,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:14,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:32:14,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:14,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:14,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:15,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:15,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:15,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:15,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:15,134 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:15,138 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:15,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:15,198 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:15,202 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:15,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 04:32:15,257 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:200, output treesize:154 [2021-06-05 04:32:15,410 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 21=[array_0]} [2021-06-05 04:32:15,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 04:32:15,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:15,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:15,426 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:15,431 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:15,435 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:15,441 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:15,446 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:15,451 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:15,456 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:15,461 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:15,466 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:32:15,470 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:15,635 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2021-06-05 04:32:15,635 INFO L628 ElimStorePlain]: treesize reduction 132, result has 58.9 percent of original size [2021-06-05 04:32:15,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 04:32:15,641 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:15,646 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:15,652 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:15,657 INFO L550 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-06-05 04:32:15,662 INFO L550 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:15,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:15,667 INFO L550 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:15,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:15,733 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2021-06-05 04:32:15,733 INFO L247 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:415, output treesize:99 [2021-06-05 04:32:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:15,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359573204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:15,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:15,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 04:32:15,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527082061] [2021-06-05 04:32:15,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:15,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:15,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:15,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:15,847 INFO L87 Difference]: Start difference. First operand 969 states and 3807 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:16,249 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2021-06-05 04:32:16,500 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 123 [2021-06-05 04:32:16,695 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2021-06-05 04:32:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:16,873 INFO L93 Difference]: Finished difference Result 1200 states and 4678 transitions. [2021-06-05 04:32:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:16,875 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 04:32:16,875 INFO L226 Difference]: Without dead ends: 1193 [2021-06-05 04:32:16,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1391.7ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:32:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2021-06-05 04:32:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 970. [2021-06-05 04:32:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 04:32:16,886 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 04:32:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:16,887 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 04:32:16,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 04:32:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:16,888 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:16,888 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:17,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4896,399 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:17,088 INFO L430 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1410858674, now seen corresponding path program 253 times [2021-06-05 04:32:17,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:17,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443099432] [2021-06-05 04:32:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:17,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:17,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443099432] [2021-06-05 04:32:17,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443099432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:17,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731729086] [2021-06-05 04:32:17,677 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:17,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:32:17,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:17,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:17,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:17,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:17,855 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:17,858 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:17,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:17,900 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:133 [2021-06-05 04:32:17,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:17,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:17,988 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:17,992 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:32:17,996 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:17,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:17,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:18,000 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:18,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:18,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:18,004 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:18,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:18,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:32:18,007 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:18,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:18,011 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:18,118 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2021-06-05 04:32:18,118 INFO L628 ElimStorePlain]: treesize reduction 135, result has 48.7 percent of original size [2021-06-05 04:32:18,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:18,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:18,122 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:18,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:18,126 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:18,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:18,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:32:18,173 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:337, output treesize:112 [2021-06-05 04:32:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:18,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731729086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:18,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:18,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:32:18,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558942219] [2021-06-05 04:32:18,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:32:18,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:32:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:32:18,393 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:19,104 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2021-06-05 04:32:19,334 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2021-06-05 04:32:19,687 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2021-06-05 04:32:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:19,963 INFO L93 Difference]: Finished difference Result 1213 states and 4699 transitions. [2021-06-05 04:32:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:32:19,963 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:19,965 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 04:32:19,965 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 04:32:19,965 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2044.9ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:32:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 04:32:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 972. [2021-06-05 04:32:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.927909371781668) internal successors, (3814), 971 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3814 transitions. [2021-06-05 04:32:19,984 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3814 transitions. Word has length 18 [2021-06-05 04:32:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:19,984 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3814 transitions. [2021-06-05 04:32:19,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3814 transitions. [2021-06-05 04:32:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:19,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:19,985 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:20,185 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4930,400 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:20,186 INFO L430 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1470869184, now seen corresponding path program 254 times [2021-06-05 04:32:20,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:20,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77454204] [2021-06-05 04:32:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:20,850 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:20,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77454204] [2021-06-05 04:32:20,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77454204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:20,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224475565] [2021-06-05 04:32:20,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:20,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:20,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:20,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:32:20,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:21,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:21,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:21,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:21,032 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:21,035 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:21,090 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:21,090 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:147 [2021-06-05 04:32:21,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:21,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:21,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:21,197 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:32:21,201 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:32:21,205 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:21,209 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:21,213 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:21,216 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,377 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-06-05 04:32:21,377 INFO L628 ElimStorePlain]: treesize reduction 131, result has 56.2 percent of original size [2021-06-05 04:32:21,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:21,381 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:21,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:21,385 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:21,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:21,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 04:32:21,389 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:21,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:21,393 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:21,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:21,453 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:32:21,453 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:365, output treesize:134 [2021-06-05 04:32:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:21,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224475565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:21,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:21,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:32:21,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612286683] [2021-06-05 04:32:21,703 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:32:21,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:32:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:32:21,703 INFO L87 Difference]: Start difference. First operand 972 states and 3814 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:22,247 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2021-06-05 04:32:22,515 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2021-06-05 04:32:23,087 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2021-06-05 04:32:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:23,399 INFO L93 Difference]: Finished difference Result 1232 states and 4740 transitions. [2021-06-05 04:32:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:32:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:23,402 INFO L225 Difference]: With dead ends: 1232 [2021-06-05 04:32:23,402 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 04:32:23,402 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2202.9ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:32:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 04:32:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 971. [2021-06-05 04:32:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 3.9278350515463916) internal successors, (3810), 970 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 3810 transitions. [2021-06-05 04:32:23,413 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 3810 transitions. Word has length 18 [2021-06-05 04:32:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:23,413 INFO L482 AbstractCegarLoop]: Abstraction has 971 states and 3810 transitions. [2021-06-05 04:32:23,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 3810 transitions. [2021-06-05 04:32:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:23,415 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:23,415 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:23,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4947,401 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:23,615 INFO L430 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:23,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1377259446, now seen corresponding path program 255 times [2021-06-05 04:32:23,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:23,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292120143] [2021-06-05 04:32:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:24,019 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-06-05 04:32:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:24,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:24,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292120143] [2021-06-05 04:32:24,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292120143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:24,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209033143] [2021-06-05 04:32:24,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:24,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:32:24,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:24,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:24,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:24,554 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:24,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:24,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:24,563 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:24,566 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:24,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:24,603 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 04:32:24,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:24,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:32:24,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:24,784 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:24,789 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:24,794 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:24,799 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:32:24,804 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:24,809 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:24,814 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,817 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:24,818 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:24,823 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,826 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:24,827 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,911 INFO L628 ElimStorePlain]: treesize reduction 137, result has 37.4 percent of original size [2021-06-05 04:32:24,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:24,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:24,916 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:24,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:24,919 INFO L550 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:24,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:24,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:32:24,948 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:355, output treesize:60 [2021-06-05 04:32:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:25,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209033143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:25,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:25,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:32:25,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058052226] [2021-06-05 04:32:25,032 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:32:25,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:32:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:32:25,033 INFO L87 Difference]: Start difference. First operand 971 states and 3810 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:25,523 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2021-06-05 04:32:26,006 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 101 [2021-06-05 04:32:26,186 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 04:32:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:26,336 INFO L93 Difference]: Finished difference Result 1203 states and 4681 transitions. [2021-06-05 04:32:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:26,338 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 04:32:26,338 INFO L226 Difference]: Without dead ends: 1196 [2021-06-05 04:32:26,339 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1910.2ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:32:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-06-05 04:32:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 970. [2021-06-05 04:32:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.928792569659443) internal successors, (3807), 969 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3807 transitions. [2021-06-05 04:32:26,350 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3807 transitions. Word has length 18 [2021-06-05 04:32:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:26,350 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3807 transitions. [2021-06-05 04:32:26,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3807 transitions. [2021-06-05 04:32:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:26,351 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:26,351 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:26,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4963,402 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:26,552 INFO L430 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1371125786, now seen corresponding path program 256 times [2021-06-05 04:32:26,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:26,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220740039] [2021-06-05 04:32:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:27,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:27,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220740039] [2021-06-05 04:32:27,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220740039] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:27,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289048692] [2021-06-05 04:32:27,053 INFO L93 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 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:27,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:32:27,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:27,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:27,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:27,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:27,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:27,266 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:27,269 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:27,272 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:27,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:27,311 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:27,314 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:27,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 04:32:27,345 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:164, output treesize:124 [2021-06-05 04:32:27,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 04:32:27,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:27,443 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:27,447 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:27,452 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:32:27,475 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:27,479 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 04:32:27,483 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:27,487 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:27,490 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,493 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:32:27,494 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:27,498 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:27,501 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:27,565 INFO L628 ElimStorePlain]: treesize reduction 158, result has 31.6 percent of original size [2021-06-05 04:32:27,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:27,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:27,569 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:27,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 04:32:27,572 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:27,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:27,595 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 04:32:27,595 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:355, output treesize:57 [2021-06-05 04:32:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:27,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289048692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:27,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:27,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:32:27,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931758613] [2021-06-05 04:32:27,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:32:27,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:32:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:32:27,700 INFO L87 Difference]: Start difference. First operand 970 states and 3807 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:28,289 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 71 [2021-06-05 04:32:28,531 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2021-06-05 04:32:28,688 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2021-06-05 04:32:28,843 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-06-05 04:32:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:28,977 INFO L93 Difference]: Finished difference Result 1215 states and 4699 transitions. [2021-06-05 04:32:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:32:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:28,979 INFO L225 Difference]: With dead ends: 1215 [2021-06-05 04:32:28,979 INFO L226 Difference]: Without dead ends: 1203 [2021-06-05 04:32:28,979 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1661.2ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:32:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-06-05 04:32:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 968. [2021-06-05 04:32:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 3.9317476732161323) internal successors, (3802), 967 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 3802 transitions. [2021-06-05 04:32:28,991 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 3802 transitions. Word has length 18 [2021-06-05 04:32:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:28,991 INFO L482 AbstractCegarLoop]: Abstraction has 968 states and 3802 transitions. [2021-06-05 04:32:28,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 3802 transitions. [2021-06-05 04:32:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:28,992 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:28,992 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:29,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4979,403 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:29,192 INFO L430 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1768721062, now seen corresponding path program 257 times [2021-06-05 04:32:29,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:29,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569583664] [2021-06-05 04:32:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:29,380 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:29,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569583664] [2021-06-05 04:32:29,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569583664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:29,380 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689019012] [2021-06-05 04:32:29,380 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:29,406 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:29,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:29,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:29,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:29,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:29,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:29,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:29,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:29,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:29,535 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:29,536 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:78 [2021-06-05 04:32:29,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:29,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:29,759 INFO L628 ElimStorePlain]: treesize reduction 70, result has 40.2 percent of original size [2021-06-05 04:32:29,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:29,762 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:29,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:29,773 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1063 vanished before elimination [2021-06-05 04:32:29,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:29,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:29,775 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:29,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:29,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:29,786 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:124, output treesize:16 [2021-06-05 04:32:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:29,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689019012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:29,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:29,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:32:29,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39154932] [2021-06-05 04:32:29,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:29,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:29,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:29,803 INFO L87 Difference]: Start difference. First operand 968 states and 3802 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:30,138 INFO L93 Difference]: Finished difference Result 1004 states and 3893 transitions. [2021-06-05 04:32:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:30,138 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:30,140 INFO L225 Difference]: With dead ends: 1004 [2021-06-05 04:32:30,140 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 04:32:30,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 438.9ms TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 04:32:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 976. [2021-06-05 04:32:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.927179487179487) internal successors, (3829), 975 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3829 transitions. [2021-06-05 04:32:30,151 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 3829 transitions. Word has length 18 [2021-06-05 04:32:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:30,151 INFO L482 AbstractCegarLoop]: Abstraction has 976 states and 3829 transitions. [2021-06-05 04:32:30,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 3829 transitions. [2021-06-05 04:32:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:30,152 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:30,152 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:30,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 404 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5003 [2021-06-05 04:32:30,352 INFO L430 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -171267684, now seen corresponding path program 258 times [2021-06-05 04:32:30,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:30,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413781180] [2021-06-05 04:32:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:30,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:30,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413781180] [2021-06-05 04:32:30,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413781180] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:30,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571931647] [2021-06-05 04:32:30,548 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:30,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:32:30,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:30,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:30,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:30,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:30,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:30,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:30,680 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:30,707 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:30,708 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:30,708 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:74 [2021-06-05 04:32:30,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:30,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:30,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:30,788 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:30,848 INFO L628 ElimStorePlain]: treesize reduction 98, result has 42.0 percent of original size [2021-06-05 04:32:30,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:30,852 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:30,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:30,874 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1065 vanished before elimination [2021-06-05 04:32:30,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:30,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:30,878 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:30,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:30,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:30,901 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:185, output treesize:44 [2021-06-05 04:32:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:30,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571931647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:30,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:30,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:32:30,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21237075] [2021-06-05 04:32:30,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:30,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:30,958 INFO L87 Difference]: Start difference. First operand 976 states and 3829 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:31,222 INFO L93 Difference]: Finished difference Result 1014 states and 3925 transitions. [2021-06-05 04:32:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:31,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:31,223 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 04:32:31,224 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 04:32:31,224 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 388.4ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 04:32:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 973. [2021-06-05 04:32:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9269547325102883) internal successors, (3817), 972 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3817 transitions. [2021-06-05 04:32:31,234 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3817 transitions. Word has length 18 [2021-06-05 04:32:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:31,234 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3817 transitions. [2021-06-05 04:32:31,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3817 transitions. [2021-06-05 04:32:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:31,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:31,235 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:31,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5027,405 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:31,437 INFO L430 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1045008364, now seen corresponding path program 259 times [2021-06-05 04:32:31,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:31,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053304769] [2021-06-05 04:32:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:31,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:31,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053304769] [2021-06-05 04:32:31,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053304769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:31,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562010204] [2021-06-05 04:32:31,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:31,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:31,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:31,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:31,783 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:31,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:31,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:31,802 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 04:32:31,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:31,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:31,849 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:31,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:31,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:31,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:31,855 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:31,858 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,893 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:32:31,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:31,896 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:31,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:31,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:31,910 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:32:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:31,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562010204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:31,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:31,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:32:31,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689703770] [2021-06-05 04:32:31,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:31,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:31,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:31,989 INFO L87 Difference]: Start difference. First operand 973 states and 3817 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:32,671 INFO L93 Difference]: Finished difference Result 1009 states and 3915 transitions. [2021-06-05 04:32:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:32,673 INFO L225 Difference]: With dead ends: 1009 [2021-06-05 04:32:32,673 INFO L226 Difference]: Without dead ends: 1004 [2021-06-05 04:32:32,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 708.6ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:32:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-06-05 04:32:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 970. [2021-06-05 04:32:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 04:32:32,683 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 04:32:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:32,683 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 04:32:32,683 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 04:32:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:32,684 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:32,684 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:32,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5038,406 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:32,885 INFO L430 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash -496091954, now seen corresponding path program 260 times [2021-06-05 04:32:32,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:32,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761013190] [2021-06-05 04:32:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:33,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:33,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761013190] [2021-06-05 04:32:33,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761013190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:33,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811788994] [2021-06-05 04:32:33,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:33,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:33,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:33,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:33,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:33,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:33,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:33,276 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:33,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:33,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:33,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:33,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:33,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:33,283 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:33,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:33,287 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:33,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:33,332 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:33,333 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:32:33,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:33,485 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:33,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:33,491 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:33,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:33,492 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:32:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:33,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811788994] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:33,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:33,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:32:33,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611565029] [2021-06-05 04:32:33,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:33,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:33,519 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:33,971 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 04:32:34,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:34,295 INFO L93 Difference]: Finished difference Result 1010 states and 3910 transitions. [2021-06-05 04:32:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:34,297 INFO L225 Difference]: With dead ends: 1010 [2021-06-05 04:32:34,297 INFO L226 Difference]: Without dead ends: 1005 [2021-06-05 04:32:34,297 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 970.2ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:32:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2021-06-05 04:32:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 977. [2021-06-05 04:32:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.930327868852459) internal successors, (3836), 976 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3836 transitions. [2021-06-05 04:32:34,308 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3836 transitions. Word has length 18 [2021-06-05 04:32:34,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:34,308 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3836 transitions. [2021-06-05 04:32:34,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3836 transitions. [2021-06-05 04:32:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:34,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:34,310 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:34,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5048,407 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:34,510 INFO L430 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1858886596, now seen corresponding path program 261 times [2021-06-05 04:32:34,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:34,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143210299] [2021-06-05 04:32:34,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:34,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:34,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143210299] [2021-06-05 04:32:34,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143210299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:34,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433450450] [2021-06-05 04:32:34,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:34,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:32:34,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:34,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:34,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:34,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:34,931 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:34,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:34,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:34,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:34,940 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:34,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:34,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:34,944 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:34,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:34,999 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:32:34,999 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:159 [2021-06-05 04:32:35,182 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 04:32:35,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:35,187 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:35,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:35,191 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:35,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:35,195 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:35,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:35,199 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:35,254 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 04:32:35,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:35,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:35,257 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:35,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:35,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:35,281 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:193, output treesize:44 [2021-06-05 04:32:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:35,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433450450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:35,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:35,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:32:35,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269813473] [2021-06-05 04:32:35,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:32:35,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:32:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:32:35,354 INFO L87 Difference]: Start difference. First operand 977 states and 3836 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:35,717 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2021-06-05 04:32:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:35,983 INFO L93 Difference]: Finished difference Result 1026 states and 3966 transitions. [2021-06-05 04:32:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:35,985 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 04:32:35,985 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 04:32:35,985 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 823.9ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:32:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 04:32:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 970. [2021-06-05 04:32:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 04:32:35,995 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 04:32:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:35,995 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 04:32:35,995 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 04:32:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:35,996 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:35,996 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:36,197 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5062,408 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:36,197 INFO L430 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:36,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash -288998972, now seen corresponding path program 262 times [2021-06-05 04:32:36,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:36,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415462423] [2021-06-05 04:32:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:36,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:36,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415462423] [2021-06-05 04:32:36,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415462423] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:36,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797948396] [2021-06-05 04:32:36,441 INFO L93 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 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:36,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:32:36,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:36,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:32:36,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:36,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:36,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:36,546 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:36,550 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:36,553 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:36,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:36,614 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:161 [2021-06-05 04:32:36,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:36,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:36,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:36,788 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:36,792 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:36,863 INFO L628 ElimStorePlain]: treesize reduction 97, result has 43.9 percent of original size [2021-06-05 04:32:36,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:36,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:36,867 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:36,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:36,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:36,899 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 04:32:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:37,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797948396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:37,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:37,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:32:37,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579457311] [2021-06-05 04:32:37,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:32:37,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:37,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:32:37,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:37,040 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:37,283 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2021-06-05 04:32:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:37,468 INFO L93 Difference]: Finished difference Result 1014 states and 3928 transitions. [2021-06-05 04:32:37,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:37,470 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 04:32:37,470 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 04:32:37,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 738.4ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:32:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 04:32:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 969. [2021-06-05 04:32:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9307851239669422) internal successors, (3805), 968 states have internal predecessors, (3805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3805 transitions. [2021-06-05 04:32:37,481 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3805 transitions. Word has length 18 [2021-06-05 04:32:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:37,481 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3805 transitions. [2021-06-05 04:32:37,481 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3805 transitions. [2021-06-05 04:32:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:37,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:37,482 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:37,682 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 409 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5086 [2021-06-05 04:32:37,682 INFO L430 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -938991094, now seen corresponding path program 263 times [2021-06-05 04:32:37,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:37,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400103877] [2021-06-05 04:32:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:38,054 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:38,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400103877] [2021-06-05 04:32:38,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400103877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:38,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76034776] [2021-06-05 04:32:38,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:38,081 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:32:38,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:38,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 04:32:38,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:38,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,361 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:32:38,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 04:32:38,362 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,365 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,367 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:32:38,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 04:32:38,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,425 INFO L628 ElimStorePlain]: treesize reduction 31, result has 77.4 percent of original size [2021-06-05 04:32:38,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,431 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 04:32:38,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 04:32:38,432 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,438 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 04:32:38,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 04:32:38,439 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:38,463 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2021-06-05 04:32:38,463 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:175, output treesize:72 [2021-06-05 04:32:38,582 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1079], 1=[array_4, v_prenex_1080]} [2021-06-05 04:32:38,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:38,586 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:38,589 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,620 INFO L628 ElimStorePlain]: treesize reduction 54, result has 48.6 percent of original size [2021-06-05 04:32:38,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:32:38,622 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:38,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:38,633 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:38,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:38,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:38,636 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:38,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:38,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 04:32:38,647 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:123, output treesize:24 [2021-06-05 04:32:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:38,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76034776] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:38,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:38,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 04:32:38,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613510242] [2021-06-05 04:32:38,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:32:38,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:32:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:32:38,682 INFO L87 Difference]: Start difference. First operand 969 states and 3805 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:39,219 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2021-06-05 04:32:39,591 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2021-06-05 04:32:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:39,722 INFO L93 Difference]: Finished difference Result 1046 states and 4019 transitions. [2021-06-05 04:32:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:32:39,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:39,724 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 04:32:39,724 INFO L226 Difference]: Without dead ends: 1036 [2021-06-05 04:32:39,724 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1202.7ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:32:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-06-05 04:32:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 970. [2021-06-05 04:32:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 04:32:39,735 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 04:32:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:39,735 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 04:32:39,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 04:32:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:39,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:39,736 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:39,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 410 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5102 [2021-06-05 04:32:39,937 INFO L430 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash -270512050, now seen corresponding path program 264 times [2021-06-05 04:32:39,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:39,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298049986] [2021-06-05 04:32:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 04:32:39,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:39,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298049986] [2021-06-05 04:32:39,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298049986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:39,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141589039] [2021-06-05 04:32:39,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:40,010 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:32:40,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:40,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 04:32:40,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:40,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:40,073 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:40,076 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:40,080 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:40,083 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:40,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:40,111 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 04:32:40,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:40,192 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:40,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:40,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:40,198 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:40,201 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:40,231 INFO L628 ElimStorePlain]: treesize reduction 60, result has 31.0 percent of original size [2021-06-05 04:32:40,231 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:40,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:40,231 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:27 [2021-06-05 04:32:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:40,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141589039] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:40,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:40,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 04:32:40,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192081801] [2021-06-05 04:32:40,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:40,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:40,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:40,260 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:41,116 INFO L93 Difference]: Finished difference Result 1214 states and 4427 transitions. [2021-06-05 04:32:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 04:32:41,116 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:41,118 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 04:32:41,118 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 04:32:41,118 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 729.6ms TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 04:32:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 04:32:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 970. [2021-06-05 04:32:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 04:32:41,129 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 04:32:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:41,129 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 04:32:41,129 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 04:32:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:41,131 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:41,131 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:41,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5137,411 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:41,331 INFO L430 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:41,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1617696392, now seen corresponding path program 265 times [2021-06-05 04:32:41,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:41,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165536281] [2021-06-05 04:32:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:41,745 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2021-06-05 04:32:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:42,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:42,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165536281] [2021-06-05 04:32:42,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165536281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:42,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531627247] [2021-06-05 04:32:42,133 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:42,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:42,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:42,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:42,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:42,258 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:42,261 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:42,265 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:42,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:42,306 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 04:32:42,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:42,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:42,440 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:42,444 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:42,447 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,491 INFO L628 ElimStorePlain]: treesize reduction 74, result has 42.6 percent of original size [2021-06-05 04:32:42,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:42,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:42,494 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:42,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:42,511 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:42,511 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:163, output treesize:41 [2021-06-05 04:32:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:42,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531627247] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:42,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:42,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 04:32:42,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707882886] [2021-06-05 04:32:42,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:32:42,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:42,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:32:42,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:32:42,586 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:43,072 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 04:32:43,295 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 04:32:43,590 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-06-05 04:32:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:43,643 INFO L93 Difference]: Finished difference Result 1006 states and 3914 transitions. [2021-06-05 04:32:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:43,645 INFO L225 Difference]: With dead ends: 1006 [2021-06-05 04:32:43,645 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 04:32:43,645 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1590.3ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:32:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 04:32:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 970. [2021-06-05 04:32:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 04:32:43,655 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 04:32:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:43,655 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 04:32:43,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 04:32:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:43,657 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:43,657 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:43,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5148,412 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:43,857 INFO L430 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:43,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:43,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1666033298, now seen corresponding path program 266 times [2021-06-05 04:32:43,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:43,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294596166] [2021-06-05 04:32:43,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:44,234 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 04:32:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:44,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:44,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294596166] [2021-06-05 04:32:44,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294596166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:44,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514027142] [2021-06-05 04:32:44,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:44,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:44,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:44,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:44,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:44,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:44,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:44,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:44,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:44,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:44,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:44,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:44,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:44,669 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:44,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:44,672 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:44,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:44,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:44,717 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:32:44,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:44,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:44,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:44,886 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:44,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:44,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 04:32:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:44,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514027142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:44,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:44,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:32:44,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591427814] [2021-06-05 04:32:44,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:32:44,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:44,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:32:44,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:32:44,917 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:45,495 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2021-06-05 04:32:45,711 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2021-06-05 04:32:45,989 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 62 [2021-06-05 04:32:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:46,132 INFO L93 Difference]: Finished difference Result 1055 states and 4054 transitions. [2021-06-05 04:32:46,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:32:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:46,134 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 04:32:46,134 INFO L226 Difference]: Without dead ends: 1045 [2021-06-05 04:32:46,134 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1648.8ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:32:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-06-05 04:32:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 973. [2021-06-05 04:32:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9372427983539096) internal successors, (3827), 972 states have internal predecessors, (3827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3827 transitions. [2021-06-05 04:32:46,145 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3827 transitions. Word has length 18 [2021-06-05 04:32:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:46,145 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3827 transitions. [2021-06-05 04:32:46,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3827 transitions. [2021-06-05 04:32:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:46,146 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:46,146 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:46,347 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5163,413 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:46,347 INFO L430 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -702614904, now seen corresponding path program 267 times [2021-06-05 04:32:46,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:46,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452809213] [2021-06-05 04:32:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:46,622 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:46,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452809213] [2021-06-05 04:32:46,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452809213] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:46,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379405652] [2021-06-05 04:32:46,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:46,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:32:46,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:46,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:46,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:46,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:32:46,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:46,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:46,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:46,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:32:46,764 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:46,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:46,767 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:46,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:46,820 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:32:46,820 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:32:46,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:46,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:46,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:46,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:46,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:47,028 INFO L628 ElimStorePlain]: treesize reduction 87, result has 43.1 percent of original size [2021-06-05 04:32:47,029 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1081 vanished before elimination [2021-06-05 04:32:47,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:47,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:47,032 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:47,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:47,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:47,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:47,055 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:47,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:47,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:47,074 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 04:32:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:47,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379405652] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:47,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:47,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:32:47,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525961903] [2021-06-05 04:32:47,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:32:47,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:32:47,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:47,135 INFO L87 Difference]: Start difference. First operand 973 states and 3827 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:47,591 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 04:32:47,751 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 04:32:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:48,100 INFO L93 Difference]: Finished difference Result 1040 states and 4021 transitions. [2021-06-05 04:32:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:32:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:48,102 INFO L225 Difference]: With dead ends: 1040 [2021-06-05 04:32:48,102 INFO L226 Difference]: Without dead ends: 1030 [2021-06-05 04:32:48,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1086.5ms TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:32:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-06-05 04:32:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 977. [2021-06-05 04:32:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 04:32:48,112 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 04:32:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:48,112 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 04:32:48,113 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 04:32:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:48,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:48,114 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:48,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 414 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5177 [2021-06-05 04:32:48,314 INFO L430 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash -591633002, now seen corresponding path program 268 times [2021-06-05 04:32:48,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:48,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136962620] [2021-06-05 04:32:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:48,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:48,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136962620] [2021-06-05 04:32:48,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136962620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:48,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291516010] [2021-06-05 04:32:48,524 INFO L93 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 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:48,576 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:32:48,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:48,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:32:48,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:48,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:48,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:48,680 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:48,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:48,710 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 04:32:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:48,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:48,818 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:48,822 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:48,825 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:48,870 INFO L628 ElimStorePlain]: treesize reduction 83, result has 38.5 percent of original size [2021-06-05 04:32:48,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:48,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:48,874 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:48,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:48,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:48,892 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 04:32:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:48,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291516010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:48,968 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:48,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:32:48,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951311050] [2021-06-05 04:32:48,969 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:48,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:48,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:48,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:48,969 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:49,479 INFO L93 Difference]: Finished difference Result 1050 states and 4071 transitions. [2021-06-05 04:32:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:49,479 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:49,481 INFO L225 Difference]: With dead ends: 1050 [2021-06-05 04:32:49,481 INFO L226 Difference]: Without dead ends: 1037 [2021-06-05 04:32:49,481 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 602.9ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:32:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-06-05 04:32:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 983. [2021-06-05 04:32:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9297352342158858) internal successors, (3859), 982 states have internal predecessors, (3859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3859 transitions. [2021-06-05 04:32:49,491 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3859 transitions. Word has length 18 [2021-06-05 04:32:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:49,491 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3859 transitions. [2021-06-05 04:32:49,491 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3859 transitions. [2021-06-05 04:32:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:49,492 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:49,492 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:49,693 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 415 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5192 [2021-06-05 04:32:49,693 INFO L430 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1763345548, now seen corresponding path program 269 times [2021-06-05 04:32:49,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:49,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767813768] [2021-06-05 04:32:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:49,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:49,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767813768] [2021-06-05 04:32:49,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767813768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:49,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627132262] [2021-06-05 04:32:49,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:49,930 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:49,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:49,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:49,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:50,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:50,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:50,027 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:50,052 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:50,052 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 04:32:50,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:50,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:50,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,218 INFO L628 ElimStorePlain]: treesize reduction 95, result has 41.0 percent of original size [2021-06-05 04:32:50,218 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1085 vanished before elimination [2021-06-05 04:32:50,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:50,222 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:50,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:50,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:50,244 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:50,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:50,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:50,264 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 04:32:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:50,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627132262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:50,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:50,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:32:50,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127131543] [2021-06-05 04:32:50,323 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:32:50,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:32:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:50,324 INFO L87 Difference]: Start difference. First operand 983 states and 3859 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:50,814 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-06-05 04:32:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:51,054 INFO L93 Difference]: Finished difference Result 1052 states and 4088 transitions. [2021-06-05 04:32:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:51,055 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:51,056 INFO L225 Difference]: With dead ends: 1052 [2021-06-05 04:32:51,056 INFO L226 Difference]: Without dead ends: 1047 [2021-06-05 04:32:51,057 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 783.2ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:32:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-06-05 04:32:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 980. [2021-06-05 04:32:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:32:51,067 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:32:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:51,067 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:32:51,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:32:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:51,069 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:51,069 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:51,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5205,416 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:51,269 INFO L430 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 889604868, now seen corresponding path program 270 times [2021-06-05 04:32:51,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:51,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415081854] [2021-06-05 04:32:51,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:51,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:51,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415081854] [2021-06-05 04:32:51,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415081854] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:51,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700347974] [2021-06-05 04:32:51,510 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:51,536 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:32:51,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:51,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:51,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:51,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:51,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:51,643 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:51,664 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:51,664 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 04:32:51,711 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1087], 1=[v_prenex_1088, array_4]} [2021-06-05 04:32:51,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:51,715 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:51,718 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,759 INFO L628 ElimStorePlain]: treesize reduction 71, result has 43.2 percent of original size [2021-06-05 04:32:51,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:51,761 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:51,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:51,778 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:51,792 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:51,792 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:51,792 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:51,792 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:32:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:51,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700347974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:51,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:51,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:32:51,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468685937] [2021-06-05 04:32:51,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:51,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:51,853 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:52,587 INFO L93 Difference]: Finished difference Result 1068 states and 4122 transitions. [2021-06-05 04:32:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:52,587 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:52,589 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 04:32:52,589 INFO L226 Difference]: Without dead ends: 1063 [2021-06-05 04:32:52,589 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 746.6ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:32:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-06-05 04:32:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 983. [2021-06-05 04:32:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 04:32:52,600 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 04:32:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:52,600 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 04:32:52,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 04:32:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:52,601 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:52,602 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:52,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 417 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5230 [2021-06-05 04:32:52,802 INFO L430 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -781371148, now seen corresponding path program 271 times [2021-06-05 04:32:52,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:52,802 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919916551] [2021-06-05 04:32:52,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:53,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:53,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919916551] [2021-06-05 04:32:53,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919916551] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:53,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624970055] [2021-06-05 04:32:53,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:53,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:32:53,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:53,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:53,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:53,161 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:53,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:53,190 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 04:32:53,343 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 04:32:53,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:53,348 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:53,352 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:53,356 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:53,359 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,408 INFO L628 ElimStorePlain]: treesize reduction 79, result has 44.8 percent of original size [2021-06-05 04:32:53,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:53,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:53,411 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:53,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:53,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:53,432 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:38 [2021-06-05 04:32:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:53,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624970055] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:53,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:53,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 04:32:53,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195741655] [2021-06-05 04:32:53,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:32:53,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:53,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:32:53,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:53,513 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:53,983 INFO L93 Difference]: Finished difference Result 1051 states and 4076 transitions. [2021-06-05 04:32:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:53,986 INFO L225 Difference]: With dead ends: 1051 [2021-06-05 04:32:53,986 INFO L226 Difference]: Without dead ends: 1040 [2021-06-05 04:32:53,986 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 581.3ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:32:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-06-05 04:32:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 977. [2021-06-05 04:32:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 04:32:53,996 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 04:32:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:53,996 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 04:32:53,996 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 04:32:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:53,998 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:53,998 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:54,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5241,418 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:54,198 INFO L430 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash 318150062, now seen corresponding path program 272 times [2021-06-05 04:32:54,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:54,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543319530] [2021-06-05 04:32:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:54,390 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:54,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543319530] [2021-06-05 04:32:54,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543319530] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:54,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433775477] [2021-06-05 04:32:54,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:54,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:32:54,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:54,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:54,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:54,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:54,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:54,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:54,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:54,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:54,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:54,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:54,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:54,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:54,519 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 04:32:54,610 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1092, array_0], 1=[v_prenex_1093, array_4]} [2021-06-05 04:32:54,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:54,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:54,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:32:54,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:54,663 INFO L628 ElimStorePlain]: treesize reduction 77, result has 42.1 percent of original size [2021-06-05 04:32:54,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:54,666 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:54,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:54,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:54,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:54,687 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:54,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:54,704 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:54,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:54,705 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 04:32:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:54,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433775477] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:54,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:54,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:32:54,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133896208] [2021-06-05 04:32:54,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:32:54,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:32:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:54,774 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:55,500 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-05 04:32:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:55,679 INFO L93 Difference]: Finished difference Result 1151 states and 4413 transitions. [2021-06-05 04:32:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:32:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:55,681 INFO L225 Difference]: With dead ends: 1151 [2021-06-05 04:32:55,681 INFO L226 Difference]: Without dead ends: 1141 [2021-06-05 04:32:55,681 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 835.7ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:32:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-06-05 04:32:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 977. [2021-06-05 04:32:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 04:32:55,692 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 04:32:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:55,693 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 04:32:55,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 04:32:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:55,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:55,694 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:55,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 419 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5253 [2021-06-05 04:32:55,894 INFO L430 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 277070352, now seen corresponding path program 273 times [2021-06-05 04:32:55,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:55,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403527696] [2021-06-05 04:32:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:56,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:56,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403527696] [2021-06-05 04:32:56,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403527696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:56,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143198164] [2021-06-05 04:32:56,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:56,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:32:56,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:56,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:32:56,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:56,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:56,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:56,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:56,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:56,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:56,260 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:32:56,260 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:85 [2021-06-05 04:32:56,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:32:56,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:56,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:32:56,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:56,495 INFO L628 ElimStorePlain]: treesize reduction 79, result has 43.6 percent of original size [2021-06-05 04:32:56,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:32:56,498 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:56,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:56,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:56,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:56,518 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:56,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:56,533 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:32:56,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:56,534 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:154, output treesize:16 [2021-06-05 04:32:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:56,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143198164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:56,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:56,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:32:56,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973901428] [2021-06-05 04:32:56,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:32:56,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:56,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:32:56,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:32:56,551 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:56,931 INFO L93 Difference]: Finished difference Result 1013 states and 3942 transitions. [2021-06-05 04:32:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:56,933 INFO L225 Difference]: With dead ends: 1013 [2021-06-05 04:32:56,933 INFO L226 Difference]: Without dead ends: 1008 [2021-06-05 04:32:56,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 479.8ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-06-05 04:32:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 983. [2021-06-05 04:32:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 04:32:56,943 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 04:32:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:56,943 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 04:32:56,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 04:32:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:56,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:56,945 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:57,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 420 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5265 [2021-06-05 04:32:57,145 INFO L430 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1662918394, now seen corresponding path program 274 times [2021-06-05 04:32:57,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:57,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377487081] [2021-06-05 04:32:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:57,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:57,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377487081] [2021-06-05 04:32:57,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377487081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:57,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877237310] [2021-06-05 04:32:57,303 INFO L93 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 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:57,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:32:57,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:57,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:32:57,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:57,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:57,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:57,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:57,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:32:57,500 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:101 [2021-06-05 04:32:57,582 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 04:32:57,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:57,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:57,592 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:57,597 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:57,603 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,673 INFO L628 ElimStorePlain]: treesize reduction 108, result has 45.2 percent of original size [2021-06-05 04:32:57,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:57,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:32:57,677 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:57,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:57,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:57,709 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:231, output treesize:87 [2021-06-05 04:32:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:57,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877237310] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:57,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:57,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:32:57,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286414850] [2021-06-05 04:32:57,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:32:57,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:57,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:32:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:32:57,870 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:58,251 INFO L93 Difference]: Finished difference Result 1023 states and 3967 transitions. [2021-06-05 04:32:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:58,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:58,253 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 04:32:58,254 INFO L226 Difference]: Without dead ends: 1011 [2021-06-05 04:32:58,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 470.0ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-06-05 04:32:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 980. [2021-06-05 04:32:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:32:58,264 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:32:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:58,264 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:32:58,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:32:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:58,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:58,266 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:58,466 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 421 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5292 [2021-06-05 04:32:58,466 INFO L430 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:58,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1758308222, now seen corresponding path program 275 times [2021-06-05 04:32:58,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:58,466 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469407132] [2021-06-05 04:32:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:32:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:58,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:32:58,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469407132] [2021-06-05 04:32:58,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469407132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:58,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778052073] [2021-06-05 04:32:58,663 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:58,690 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:32:58,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:32:58,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:32:58,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:32:58,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:58,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:58,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:58,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:58,866 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:58,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:32:58,869 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:94 [2021-06-05 04:32:58,950 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 04:32:58,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:58,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:58,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:32:58,961 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:58,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:32:58,966 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:58,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:58,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:32:58,970 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:32:59,040 INFO L628 ElimStorePlain]: treesize reduction 110, result has 43.0 percent of original size [2021-06-05 04:32:59,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:32:59,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:32:59,044 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:32:59,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:32:59,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:32:59,076 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:231, output treesize:90 [2021-06-05 04:32:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:32:59,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778052073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:32:59,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:32:59,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 04:32:59,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815176529] [2021-06-05 04:32:59,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:32:59,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:32:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:32:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:32:59,262 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:32:59,632 INFO L93 Difference]: Finished difference Result 1021 states and 3966 transitions. [2021-06-05 04:32:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:32:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:32:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:32:59,634 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 04:32:59,634 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 04:32:59,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 516.7ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:32:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 04:32:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 980. [2021-06-05 04:32:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:32:59,644 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:32:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:32:59,644 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:32:59,644 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:32:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:32:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:32:59,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:32:59,646 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:32:59,846 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5305,422 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:32:59,846 INFO L430 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:32:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:32:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1987742664, now seen corresponding path program 276 times [2021-06-05 04:32:59,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:32:59,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043044022] [2021-06-05 04:32:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:32:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:00,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:00,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043044022] [2021-06-05 04:33:00,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043044022] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:00,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958629604] [2021-06-05 04:33:00,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:00,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:33:00,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:00,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:00,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:00,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:00,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:00,302 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:00,308 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:00,313 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:00,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:00,376 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:213, output treesize:181 [2021-06-05 04:33:00,681 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1110, array_4], 3=[v_prenex_1109, array_2]} [2021-06-05 04:33:00,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:00,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:00,694 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,734 INFO L628 ElimStorePlain]: treesize reduction 87, result has 43.5 percent of original size [2021-06-05 04:33:00,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:33:00,738 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:00,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:00,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:00,757 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:00,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:00,772 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:33:00,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:00,773 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 04:33:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:00,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958629604] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:00,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:00,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 04:33:00,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980359764] [2021-06-05 04:33:00,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:00,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:00,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:00,801 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:01,168 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-06-05 04:33:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:01,530 INFO L93 Difference]: Finished difference Result 1019 states and 3957 transitions. [2021-06-05 04:33:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:01,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:01,532 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 04:33:01,532 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 04:33:01,532 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 972.0ms TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:33:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 04:33:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 984. [2021-06-05 04:33:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 04:33:01,542 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 04:33:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:01,542 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 04:33:01,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 04:33:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:01,543 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:01,543 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:01,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 423 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5320 [2021-06-05 04:33:01,744 INFO L430 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:01,744 INFO L82 PathProgramCache]: Analyzing trace with hash 367235886, now seen corresponding path program 277 times [2021-06-05 04:33:01,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:01,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910479621] [2021-06-05 04:33:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:02,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:02,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910479621] [2021-06-05 04:33:02,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910479621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:02,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257353111] [2021-06-05 04:33:02,010 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:02,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 04:33:02,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:02,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:02,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:02,133 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:02,136 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:02,140 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:02,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:02,198 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:153 [2021-06-05 04:33:02,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:02,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:02,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:02,359 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:02,363 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,437 INFO L628 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2021-06-05 04:33:02,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:02,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:02,440 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:02,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:02,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:02,467 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:193, output treesize:56 [2021-06-05 04:33:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:02,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257353111] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:02,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:02,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 04:33:02,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812966437] [2021-06-05 04:33:02,588 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:33:02,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:33:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:02,588 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:03,029 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 04:33:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:03,241 INFO L93 Difference]: Finished difference Result 1035 states and 4003 transitions. [2021-06-05 04:33:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:03,243 INFO L225 Difference]: With dead ends: 1035 [2021-06-05 04:33:03,243 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 04:33:03,243 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 901.0ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:33:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 04:33:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2021-06-05 04:33:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:33:03,253 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:33:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:03,253 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:33:03,253 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:33:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:03,254 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:03,255 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:03,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5336,424 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:03,455 INFO L430 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1780649682, now seen corresponding path program 278 times [2021-06-05 04:33:03,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:03,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242045861] [2021-06-05 04:33:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:03,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:03,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242045861] [2021-06-05 04:33:03,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242045861] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:03,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160779089] [2021-06-05 04:33:03,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:03,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:03,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:03,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:03,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:03,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:03,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:03,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:03,908 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:03,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:03,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:03,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:03,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:03,924 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:03,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:03,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:33:03,984 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:173, output treesize:141 [2021-06-05 04:33:04,144 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 04:33:04,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:04,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:04,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:04,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:04,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:04,152 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:04,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:04,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:04,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:04,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:04,159 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:04,208 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 04:33:04,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:04,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:04,212 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:04,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:04,231 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:04,232 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:33:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:04,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160779089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:04,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:04,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:04,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177716189] [2021-06-05 04:33:04,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:04,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:04,299 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:04,757 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2021-06-05 04:33:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:05,212 INFO L93 Difference]: Finished difference Result 1026 states and 3994 transitions. [2021-06-05 04:33:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:05,214 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 04:33:05,214 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 04:33:05,214 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1025.7ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:33:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 04:33:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 980. [2021-06-05 04:33:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:33:05,225 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:33:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:05,225 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:33:05,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:33:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:05,226 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:05,226 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:05,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 425 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5352 [2021-06-05 04:33:05,427 INFO L430 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:05,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -2015362562, now seen corresponding path program 279 times [2021-06-05 04:33:05,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:05,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759975439] [2021-06-05 04:33:05,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:05,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:05,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759975439] [2021-06-05 04:33:05,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759975439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:05,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599275474] [2021-06-05 04:33:05,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:05,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:33:05,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:05,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:05,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:05,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:05,826 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:05,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:05,830 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:05,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:05,833 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:05,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:05,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:05,836 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:05,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:05,874 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:33:05,874 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:109 [2021-06-05 04:33:06,050 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 04:33:06,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:06,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:06,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:06,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:06,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:06,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:06,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:06,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:06,062 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:06,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:06,066 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:06,117 INFO L628 ElimStorePlain]: treesize reduction 76, result has 44.5 percent of original size [2021-06-05 04:33:06,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:06,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:06,120 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:06,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:06,139 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:06,139 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:33:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:06,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599275474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:06,204 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:06,204 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:06,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839646846] [2021-06-05 04:33:06,205 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:06,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:06,205 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:07,088 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2021-06-05 04:33:07,236 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-06-05 04:33:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:07,301 INFO L93 Difference]: Finished difference Result 1155 states and 4452 transitions. [2021-06-05 04:33:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:07,303 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 04:33:07,303 INFO L226 Difference]: Without dead ends: 1150 [2021-06-05 04:33:07,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1141.2ms TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:33:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2021-06-05 04:33:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 981. [2021-06-05 04:33:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 04:33:07,314 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 04:33:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:07,314 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 04:33:07,314 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 04:33:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:07,315 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:07,316 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:07,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5377,426 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:07,516 INFO L430 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash -740413884, now seen corresponding path program 280 times [2021-06-05 04:33:07,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:07,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296156271] [2021-06-05 04:33:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:07,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:07,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296156271] [2021-06-05 04:33:07,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296156271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:07,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646909296] [2021-06-05 04:33:07,794 INFO L93 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 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:07,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:33:07,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:07,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:07,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:07,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:07,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:07,911 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:07,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:07,915 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:07,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:07,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:07,918 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:07,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:07,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:33:07,956 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:99 [2021-06-05 04:33:08,177 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 04:33:08,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:08,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:08,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:08,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:08,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:08,184 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:08,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:08,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:08,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:08,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:08,191 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:08,241 INFO L628 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2021-06-05 04:33:08,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:08,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:08,245 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:08,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:08,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:08,265 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 04:33:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:08,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646909296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:08,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:08,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:08,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355698225] [2021-06-05 04:33:08,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:08,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:08,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:08,331 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:08,783 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2021-06-05 04:33:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:09,068 INFO L93 Difference]: Finished difference Result 1055 states and 4095 transitions. [2021-06-05 04:33:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:09,070 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 04:33:09,070 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 04:33:09,070 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 899.7ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:33:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 04:33:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 978. [2021-06-05 04:33:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:09,081 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:09,081 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:09,081 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:09,082 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:09,082 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:09,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5402,427 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:09,283 INFO L430 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash -145415374, now seen corresponding path program 281 times [2021-06-05 04:33:09,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:09,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358556364] [2021-06-05 04:33:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:09,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:09,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358556364] [2021-06-05 04:33:09,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358556364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:09,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737873170] [2021-06-05 04:33:09,467 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:09,493 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:09,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:09,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:09,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:09,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:09,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:09,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:09,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:33:09,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 04:33:09,789 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_1124], 3=[array_2, v_prenex_1123]} [2021-06-05 04:33:09,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:09,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:09,798 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,840 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.8 percent of original size [2021-06-05 04:33:09,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:09,843 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:09,859 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:33:09,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:09,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:09,862 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:09,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:09,878 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:09,878 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 04:33:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:09,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737873170] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:09,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:09,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:33:09,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697889664] [2021-06-05 04:33:09,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:33:09,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:33:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:33:09,894 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:10,312 INFO L93 Difference]: Finished difference Result 1002 states and 3899 transitions. [2021-06-05 04:33:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:10,313 INFO L225 Difference]: With dead ends: 1002 [2021-06-05 04:33:10,314 INFO L226 Difference]: Without dead ends: 997 [2021-06-05 04:33:10,314 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 467.8ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-06-05 04:33:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 985. [2021-06-05 04:33:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 04:33:10,324 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 04:33:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:10,324 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 04:33:10,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 04:33:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:10,325 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:10,325 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:10,525 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5427,428 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:10,526 INFO L430 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2085404120, now seen corresponding path program 282 times [2021-06-05 04:33:10,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:10,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906066622] [2021-06-05 04:33:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:10,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:10,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906066622] [2021-06-05 04:33:10,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906066622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:10,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964833089] [2021-06-05 04:33:10,709 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:10,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:33:10,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:10,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:10,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:10,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:10,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:10,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:10,853 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:10,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:10,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:33:10,888 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 04:33:10,974 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1130, array_4], 3=[array_2, v_prenex_1129]} [2021-06-05 04:33:10,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:10,979 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:10,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:10,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:10,984 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:11,043 INFO L628 ElimStorePlain]: treesize reduction 107, result has 44.0 percent of original size [2021-06-05 04:33:11,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:33:11,047 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:11,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:11,071 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:33:11,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:11,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:11,075 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:11,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:11,100 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:11,100 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 04:33:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:11,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964833089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:11,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:11,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:33:11,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945281965] [2021-06-05 04:33:11,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:33:11,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:33:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:33:11,149 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:11,546 INFO L93 Difference]: Finished difference Result 1012 states and 3931 transitions. [2021-06-05 04:33:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:11,548 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 04:33:11,548 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 04:33:11,548 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 425.8ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 04:33:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 982. [2021-06-05 04:33:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 04:33:11,557 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 04:33:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:11,558 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 04:33:11,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 04:33:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:11,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:11,559 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:11,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 429 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5441 [2021-06-05 04:33:11,759 INFO L430 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1335822496, now seen corresponding path program 283 times [2021-06-05 04:33:11,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:11,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808153920] [2021-06-05 04:33:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:11,976 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:11,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808153920] [2021-06-05 04:33:11,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808153920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:11,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221668706] [2021-06-05 04:33:11,976 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:12,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:12,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:12,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:12,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:12,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:12,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:33:12,157 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:66 [2021-06-05 04:33:12,222 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 04:33:12,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:12,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:12,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:12,235 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:12,238 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,283 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 04:33:12,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:12,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:12,287 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:12,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:12,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:12,306 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 04:33:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:12,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221668706] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:12,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:12,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:12,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239586377] [2021-06-05 04:33:12,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:12,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:12,367 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:13,006 INFO L93 Difference]: Finished difference Result 1007 states and 3921 transitions. [2021-06-05 04:33:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:13,008 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 04:33:13,008 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 04:33:13,009 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 696.8ms TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:33:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 04:33:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 979. [2021-06-05 04:33:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 04:33:13,027 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 04:33:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:13,027 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 04:33:13,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 04:33:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:13,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:13,028 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:13,229 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 430 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5454 [2021-06-05 04:33:13,229 INFO L430 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1884738906, now seen corresponding path program 284 times [2021-06-05 04:33:13,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:13,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48096348] [2021-06-05 04:33:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:13,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:13,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48096348] [2021-06-05 04:33:13,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48096348] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:13,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131816044] [2021-06-05 04:33:13,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:13,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:13,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:13,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:13,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:13,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:13,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:13,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:13,615 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:13,619 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:13,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:13,671 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:33:13,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:13,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,879 INFO L628 ElimStorePlain]: treesize reduction 62, result has 37.4 percent of original size [2021-06-05 04:33:13,879 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:13,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:33:13,882 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:13,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:13,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:13,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:13,893 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:13,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:13,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:13,901 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 04:33:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:13,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131816044] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:13,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:13,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:13,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689007151] [2021-06-05 04:33:13,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:13,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:13,927 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:14,336 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 04:33:14,619 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2021-06-05 04:33:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:14,706 INFO L93 Difference]: Finished difference Result 1008 states and 3916 transitions. [2021-06-05 04:33:14,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:14,707 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:14,708 INFO L225 Difference]: With dead ends: 1008 [2021-06-05 04:33:14,708 INFO L226 Difference]: Without dead ends: 1003 [2021-06-05 04:33:14,708 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 941.2ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:33:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-06-05 04:33:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 986. [2021-06-05 04:33:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 3.931979695431472) internal successors, (3873), 985 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 3873 transitions. [2021-06-05 04:33:14,718 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 3873 transitions. Word has length 18 [2021-06-05 04:33:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:14,718 INFO L482 AbstractCegarLoop]: Abstraction has 986 states and 3873 transitions. [2021-06-05 04:33:14,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 3873 transitions. [2021-06-05 04:33:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:14,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:14,720 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:14,921 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 431 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5468 [2021-06-05 04:33:14,921 INFO L430 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash -55249840, now seen corresponding path program 285 times [2021-06-05 04:33:14,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:14,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298704298] [2021-06-05 04:33:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:15,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:15,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298704298] [2021-06-05 04:33:15,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298704298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:15,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473842620] [2021-06-05 04:33:15,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:15,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:33:15,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:15,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:15,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:15,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:15,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:15,334 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:15,338 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:15,341 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:15,381 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:15,381 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:131 [2021-06-05 04:33:15,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:15,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:15,505 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:15,509 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:15,512 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:15,555 INFO L628 ElimStorePlain]: treesize reduction 83, result has 38.5 percent of original size [2021-06-05 04:33:15,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:15,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:15,558 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:15,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:15,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:15,576 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 04:33:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:15,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473842620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:15,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:15,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:15,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317591081] [2021-06-05 04:33:15,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:15,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:15,644 INFO L87 Difference]: Start difference. First operand 986 states and 3873 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:16,046 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-06-05 04:33:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:16,319 INFO L93 Difference]: Finished difference Result 1024 states and 3972 transitions. [2021-06-05 04:33:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:16,321 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 04:33:16,321 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 04:33:16,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 835.3ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:33:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 04:33:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 979. [2021-06-05 04:33:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 04:33:16,333 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 04:33:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:16,333 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 04:33:16,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 04:33:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:16,335 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:16,335 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:16,535 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 432 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5483 [2021-06-05 04:33:16,535 INFO L430 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2091831888, now seen corresponding path program 286 times [2021-06-05 04:33:16,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:16,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195494607] [2021-06-05 04:33:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:16,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:16,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195494607] [2021-06-05 04:33:16,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195494607] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:16,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088447690] [2021-06-05 04:33:16,792 INFO L93 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 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:16,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:33:16,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:16,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:33:16,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:16,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:16,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:16,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:16,897 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:16,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:16,901 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:16,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:16,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:16,905 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:16,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:16,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:16,965 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:163 [2021-06-05 04:33:17,222 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 04:33:17,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:17,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:17,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:17,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:17,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:17,237 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:17,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:17,241 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:17,311 INFO L628 ElimStorePlain]: treesize reduction 104, result has 44.4 percent of original size [2021-06-05 04:33:17,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:17,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:17,316 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:17,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:17,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:17,348 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:223, output treesize:87 [2021-06-05 04:33:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:17,537 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088447690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:17,537 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:17,537 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:33:17,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786353556] [2021-06-05 04:33:17,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:17,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:17,538 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:17,882 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2021-06-05 04:33:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:18,125 INFO L93 Difference]: Finished difference Result 1012 states and 3934 transitions. [2021-06-05 04:33:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:18,127 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 04:33:18,127 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 04:33:18,128 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 838.1ms TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 04:33:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 978. [2021-06-05 04:33:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:18,139 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:18,139 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:18,140 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:18,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:18,141 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:18,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 433 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5498 [2021-06-05 04:33:18,341 INFO L430 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1441839766, now seen corresponding path program 287 times [2021-06-05 04:33:18,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:18,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59396565] [2021-06-05 04:33:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:18,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:18,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59396565] [2021-06-05 04:33:18,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59396565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:18,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808846763] [2021-06-05 04:33:18,709 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:18,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:33:18,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:18,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:18,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:18,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:18,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:18,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:18,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:18,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:18,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:18,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:18,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:18,843 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:18,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:18,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:18,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:18,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:18,893 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 04:33:19,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:19,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:19,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:33:19,049 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:19,071 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 04:33:19,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:19,074 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:19,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:19,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:19,080 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 04:33:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:19,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808846763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:19,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:19,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:33:19,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978263828] [2021-06-05 04:33:19,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:33:19,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:33:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:19,108 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:19,568 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-06-05 04:33:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:19,919 INFO L93 Difference]: Finished difference Result 1007 states and 3912 transitions. [2021-06-05 04:33:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:19,919 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:19,921 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 04:33:19,921 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 04:33:19,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1080.5ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:33:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 04:33:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 984. [2021-06-05 04:33:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 04:33:19,931 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 04:33:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:19,931 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 04:33:19,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 04:33:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:19,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:19,933 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:20,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5512,434 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:20,133 INFO L430 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash -498148980, now seen corresponding path program 288 times [2021-06-05 04:33:20,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:20,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019134799] [2021-06-05 04:33:20,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:20,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:20,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019134799] [2021-06-05 04:33:20,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019134799] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:20,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721629983] [2021-06-05 04:33:20,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:20,586 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:33:20,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:20,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:20,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:20,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:20,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:20,696 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:20,699 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:20,703 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:20,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:20,737 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 04:33:20,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:20,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:20,851 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:20,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:20,854 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:20,857 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:20,892 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 04:33:20,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:20,895 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:20,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:20,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:20,910 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:20,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721629983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:20,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:20,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:33:20,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069515091] [2021-06-05 04:33:20,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:33:20,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:33:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:20,974 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:21,450 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 04:33:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:21,913 INFO L93 Difference]: Finished difference Result 1023 states and 3966 transitions. [2021-06-05 04:33:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:21,914 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:21,915 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 04:33:21,915 INFO L226 Difference]: Without dead ends: 1018 [2021-06-05 04:33:21,916 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1107.3ms TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:33:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-06-05 04:33:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 978. [2021-06-05 04:33:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:21,926 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:21,926 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:21,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:21,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:21,928 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:22,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5526,435 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:22,128 INFO L430 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 763134468, now seen corresponding path program 289 times [2021-06-05 04:33:22,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:22,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709651714] [2021-06-05 04:33:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:22,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:22,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709651714] [2021-06-05 04:33:22,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709651714] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:22,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245660769] [2021-06-05 04:33:22,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:22,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:33:22,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:23,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:23,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:23,009 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:23,013 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:23,016 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,057 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:23,058 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:23,058 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 04:33:23,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:23,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:23,188 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:23,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:23,192 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:23,194 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,230 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:33:23,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:23,232 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:23,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:23,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:23,246 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:23,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245660769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:23,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:23,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:33:23,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927392327] [2021-06-05 04:33:23,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:33:23,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:33:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:33:23,319 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:23,615 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2021-06-05 04:33:24,075 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 04:33:24,285 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 04:33:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:24,662 INFO L93 Difference]: Finished difference Result 1011 states and 3933 transitions. [2021-06-05 04:33:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:24,664 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 04:33:24,664 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 04:33:24,664 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1782.5ms TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:33:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 04:33:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 980. [2021-06-05 04:33:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:33:24,674 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:33:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:24,674 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:33:24,674 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:33:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:24,676 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:24,676 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:24,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5540,436 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:24,876 INFO L430 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash -255309622, now seen corresponding path program 290 times [2021-06-05 04:33:24,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:24,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673351642] [2021-06-05 04:33:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:25,227 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:25,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673351642] [2021-06-05 04:33:25,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673351642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:25,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790922356] [2021-06-05 04:33:25,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:25,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:25,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:25,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:25,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:25,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:25,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:25,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:25,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:25,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:25,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:25,345 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:25,348 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:25,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:25,383 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 04:33:25,529 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1144], 1=[array_4, v_prenex_1145]} [2021-06-05 04:33:25,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:25,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:25,535 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,577 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 04:33:25,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:25,580 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:25,595 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:25,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:25,597 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:25,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:25,612 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:25,612 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 04:33:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:25,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790922356] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:25,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:25,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:33:25,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335759572] [2021-06-05 04:33:25,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:33:25,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:25,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:33:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:25,680 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:26,075 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 04:33:26,413 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2021-06-05 04:33:26,620 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2021-06-05 04:33:26,834 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2021-06-05 04:33:27,006 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 04:33:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:27,081 INFO L93 Difference]: Finished difference Result 1121 states and 4276 transitions. [2021-06-05 04:33:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:27,083 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 04:33:27,083 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 04:33:27,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1510.6ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:33:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 04:33:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 982. [2021-06-05 04:33:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 04:33:27,094 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 04:33:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:27,094 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 04:33:27,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 04:33:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:27,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:27,096 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:27,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5554,437 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:27,296 INFO L430 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1019639056, now seen corresponding path program 291 times [2021-06-05 04:33:27,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:27,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303342554] [2021-06-05 04:33:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:27,680 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2021-06-05 04:33:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:27,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:27,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303342554] [2021-06-05 04:33:27,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303342554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:27,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134747863] [2021-06-05 04:33:27,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:27,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:33:27,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:27,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:27,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:28,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:28,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:28,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:28,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:28,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:28,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:28,031 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:28,034 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:28,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:28,068 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 04:33:28,255 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1146], 1=[array_4, v_prenex_1147]} [2021-06-05 04:33:28,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:28,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:28,262 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,303 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 04:33:28,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:28,305 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:28,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:28,320 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:28,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:28,323 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:28,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:28,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:28,338 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:28,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134747863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:28,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:28,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:33:28,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986831511] [2021-06-05 04:33:28,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:33:28,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:33:28,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:28,408 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:28,846 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 04:33:29,104 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2021-06-05 04:33:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:29,794 INFO L93 Difference]: Finished difference Result 1066 states and 4047 transitions. [2021-06-05 04:33:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:33:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:29,796 INFO L225 Difference]: With dead ends: 1066 [2021-06-05 04:33:29,796 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 04:33:29,797 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1659.8ms TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:33:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 04:33:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 985. [2021-06-05 04:33:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 04:33:29,815 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 04:33:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:29,815 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 04:33:29,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 04:33:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:29,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:29,817 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:30,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 438 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5571 [2021-06-05 04:33:30,017 INFO L430 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:30,017 INFO L82 PathProgramCache]: Analyzing trace with hash -651336960, now seen corresponding path program 292 times [2021-06-05 04:33:30,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:30,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177218079] [2021-06-05 04:33:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:30,206 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2021-06-05 04:33:30,449 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2021-06-05 04:33:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:30,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:30,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177218079] [2021-06-05 04:33:30,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177218079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:30,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36943353] [2021-06-05 04:33:30,746 INFO L93 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 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:30,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:33:30,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:30,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:33:30,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:30,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:30,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:30,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:30,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:30,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:30,862 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:30,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:30,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:30,865 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:30,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:30,868 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:30,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:30,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:30,903 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 04:33:31,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:31,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:31,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:31,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:31,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:31,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:31,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:31,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:31,133 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:31,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:31,136 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:31,185 INFO L628 ElimStorePlain]: treesize reduction 81, result has 36.2 percent of original size [2021-06-05 04:33:31,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:31,188 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:31,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:31,204 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:31,204 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 04:33:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:31,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36943353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:31,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:31,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:33:31,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639689706] [2021-06-05 04:33:31,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:33:31,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:33:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:33:31,278 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:31,694 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2021-06-05 04:33:31,919 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-05 04:33:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:32,782 INFO L93 Difference]: Finished difference Result 1054 states and 4021 transitions. [2021-06-05 04:33:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:33:32,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:32,784 INFO L225 Difference]: With dead ends: 1054 [2021-06-05 04:33:32,784 INFO L226 Difference]: Without dead ends: 1035 [2021-06-05 04:33:32,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1899.1ms TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2021-06-05 04:33:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-06-05 04:33:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 981. [2021-06-05 04:33:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 04:33:32,804 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 04:33:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:32,804 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 04:33:32,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 04:33:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:32,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:32,805 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:33,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5587,439 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:33,006 INFO L430 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1349294162, now seen corresponding path program 293 times [2021-06-05 04:33:33,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:33,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990597311] [2021-06-05 04:33:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:33,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:33,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990597311] [2021-06-05 04:33:33,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990597311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:33,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627513923] [2021-06-05 04:33:33,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:33,323 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:33:33,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:33,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:33,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:33,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:33,416 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:33,420 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:33,424 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:33,427 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:33,463 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:33,463 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 04:33:33,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:33,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:33,578 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:33,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:33,581 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:33,584 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,620 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 04:33:33,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:33,623 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:33,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:33,637 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:33,637 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:33:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:33,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627513923] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:33,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:33,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:33:33,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806018290] [2021-06-05 04:33:33,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:33:33,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:33:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:33,704 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:34,283 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 04:33:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:34,681 INFO L93 Difference]: Finished difference Result 1020 states and 3953 transitions. [2021-06-05 04:33:34,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:33:34,681 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:34,683 INFO L225 Difference]: With dead ends: 1020 [2021-06-05 04:33:34,683 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 04:33:34,683 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 994.9ms TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:33:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 04:33:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2021-06-05 04:33:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:34,693 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:34,693 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:34,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:34,695 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:34,695 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:34,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5600,440 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:34,895 INFO L430 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -781882228, now seen corresponding path program 294 times [2021-06-05 04:33:34,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:34,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416421368] [2021-06-05 04:33:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:35,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:35,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416421368] [2021-06-05 04:33:35,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416421368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:35,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295914025] [2021-06-05 04:33:35,082 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:35,107 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:33:35,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:35,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:35,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:35,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:35,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:35,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:35,206 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:35,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:35,234 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:35,234 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:74 [2021-06-05 04:33:35,392 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1152, array_2, v_prenex_1151], 3=[array_4]} [2021-06-05 04:33:35,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:35,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:35,429 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 04:33:35,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 04:33:35,432 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:35,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:35,443 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1151 vanished before elimination [2021-06-05 04:33:35,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:35,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:35,446 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:35,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:35,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:35,458 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:124, output treesize:16 [2021-06-05 04:33:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:35,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295914025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:35,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:35,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:33:35,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065618199] [2021-06-05 04:33:35,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:33:35,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:33:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:33:35,475 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:35,855 INFO L93 Difference]: Finished difference Result 1012 states and 3929 transitions. [2021-06-05 04:33:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:35,857 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 04:33:35,857 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 04:33:35,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 509.4ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 04:33:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 981. [2021-06-05 04:33:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 04:33:35,867 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 04:33:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:35,867 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 04:33:35,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:35,867 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 04:33:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:35,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:35,869 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:36,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5614,441 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:36,069 INFO L430 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1573096322, now seen corresponding path program 295 times [2021-06-05 04:33:36,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:36,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418613231] [2021-06-05 04:33:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:36,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:36,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418613231] [2021-06-05 04:33:36,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418613231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:36,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590066603] [2021-06-05 04:33:36,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:36,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:33:36,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:36,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:36,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:36,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:36,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:36,440 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:86 [2021-06-05 04:33:36,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:36,510 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:36,514 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:36,518 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:36,522 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:36,594 INFO L628 ElimStorePlain]: treesize reduction 107, result has 41.5 percent of original size [2021-06-05 04:33:36,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:36,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:36,598 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:36,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:36,629 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:36,630 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 04:33:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:36,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590066603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:36,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:36,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 04:33:36,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067820959] [2021-06-05 04:33:36,761 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:33:36,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:33:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:33:36,761 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:37,056 INFO L93 Difference]: Finished difference Result 1022 states and 3954 transitions. [2021-06-05 04:33:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:37,056 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:37,058 INFO L225 Difference]: With dead ends: 1022 [2021-06-05 04:33:37,058 INFO L226 Difference]: Without dead ends: 1010 [2021-06-05 04:33:37,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 492.4ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-06-05 04:33:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 978. [2021-06-05 04:33:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:37,068 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:37,068 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:37,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:37,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:37,070 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:37,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5625,442 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:37,270 INFO L430 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 699355642, now seen corresponding path program 296 times [2021-06-05 04:33:37,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:37,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134057904] [2021-06-05 04:33:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:37,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:37,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134057904] [2021-06-05 04:33:37,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134057904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:37,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713079012] [2021-06-05 04:33:37,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:37,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:37,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:37,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:37,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:37,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:37,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:37,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:37,617 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:37,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:37,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:37,620 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:37,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:37,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:37,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 04:33:37,696 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1155], 1=[array_4, v_prenex_1156]} [2021-06-05 04:33:37,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:37,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:37,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:37,703 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:37,751 INFO L628 ElimStorePlain]: treesize reduction 89, result has 40.3 percent of original size [2021-06-05 04:33:37,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:37,754 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:37,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:37,771 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:37,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:37,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:37,775 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:37,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:37,792 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:37,792 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 04:33:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:37,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713079012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:37,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:37,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:37,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271536633] [2021-06-05 04:33:37,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:37,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:37,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:37,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:37,859 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:38,556 INFO L93 Difference]: Finished difference Result 1025 states and 3965 transitions. [2021-06-05 04:33:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:38,556 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:38,558 INFO L225 Difference]: With dead ends: 1025 [2021-06-05 04:33:38,558 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 04:33:38,558 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 759.5ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:33:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 04:33:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 975. [2021-06-05 04:33:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.935318275154004) internal successors, (3833), 974 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3833 transitions. [2021-06-05 04:33:38,568 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3833 transitions. Word has length 18 [2021-06-05 04:33:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:38,568 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3833 transitions. [2021-06-05 04:33:38,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3833 transitions. [2021-06-05 04:33:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:38,569 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:38,569 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:38,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 443 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5639 [2021-06-05 04:33:38,770 INFO L430 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1248272052, now seen corresponding path program 297 times [2021-06-05 04:33:38,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:38,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066976296] [2021-06-05 04:33:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:39,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:39,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066976296] [2021-06-05 04:33:39,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066976296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:39,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139377636] [2021-06-05 04:33:39,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:39,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:33:39,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:39,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:39,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:39,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:39,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:39,211 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:39,214 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:39,217 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:39,269 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:39,269 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:141 [2021-06-05 04:33:39,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:39,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:39,452 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,475 INFO L628 ElimStorePlain]: treesize reduction 62, result has 36.7 percent of original size [2021-06-05 04:33:39,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:39,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:39,478 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:39,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:39,486 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1158 vanished before elimination [2021-06-05 04:33:39,486 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1157 vanished before elimination [2021-06-05 04:33:39,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:39,486 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:114, output treesize:16 [2021-06-05 04:33:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:39,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139377636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:39,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:39,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:39,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163338828] [2021-06-05 04:33:39,511 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:39,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:39,512 INFO L87 Difference]: Start difference. First operand 975 states and 3833 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:39,891 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 04:33:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:40,245 INFO L93 Difference]: Finished difference Result 1017 states and 3942 transitions. [2021-06-05 04:33:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:40,247 INFO L225 Difference]: With dead ends: 1017 [2021-06-05 04:33:40,247 INFO L226 Difference]: Without dead ends: 1012 [2021-06-05 04:33:40,247 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 935.2ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:33:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-06-05 04:33:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 981. [2021-06-05 04:33:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9357142857142855) internal successors, (3857), 980 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3857 transitions. [2021-06-05 04:33:40,257 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3857 transitions. Word has length 18 [2021-06-05 04:33:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:40,257 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3857 transitions. [2021-06-05 04:33:40,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3857 transitions. [2021-06-05 04:33:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:40,259 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:40,259 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:40,459 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 444 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5650 [2021-06-05 04:33:40,459 INFO L430 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash -691716694, now seen corresponding path program 298 times [2021-06-05 04:33:40,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:40,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898381888] [2021-06-05 04:33:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:40,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:40,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898381888] [2021-06-05 04:33:40,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898381888] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:40,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482358765] [2021-06-05 04:33:40,751 INFO L93 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 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:40,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:33:40,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:40,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:33:40,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:40,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:40,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:40,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:40,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:40,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:40,860 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:40,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:40,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:40,864 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:40,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:40,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:40,923 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:161 [2021-06-05 04:33:41,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:41,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:41,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:41,083 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:41,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:41,087 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:41,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:41,091 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:41,164 INFO L628 ElimStorePlain]: treesize reduction 107, result has 41.5 percent of original size [2021-06-05 04:33:41,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:41,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:41,168 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:41,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:41,199 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:41,199 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 04:33:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:41,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482358765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:41,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:41,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 04:33:41,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653725119] [2021-06-05 04:33:41,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:41,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:41,321 INFO L87 Difference]: Start difference. First operand 981 states and 3857 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:41,704 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 04:33:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:41,934 INFO L93 Difference]: Finished difference Result 1037 states and 4000 transitions. [2021-06-05 04:33:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:41,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:41,936 INFO L225 Difference]: With dead ends: 1037 [2021-06-05 04:33:41,936 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 04:33:41,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 853.9ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:33:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 04:33:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 981. [2021-06-05 04:33:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 04:33:41,946 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 04:33:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:41,946 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 04:33:41,946 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 04:33:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:41,947 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:41,947 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:42,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5665,445 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:42,148 INFO L430 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1455365034, now seen corresponding path program 299 times [2021-06-05 04:33:42,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:42,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967859084] [2021-06-05 04:33:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:42,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:42,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967859084] [2021-06-05 04:33:42,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967859084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:42,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966313716] [2021-06-05 04:33:42,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:42,432 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:42,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:42,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:42,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:42,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:42,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:42,545 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:42,550 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:42,554 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:42,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:33:42,611 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:155 [2021-06-05 04:33:42,790 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 04:33:42,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:42,795 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:42,799 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:42,804 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:42,808 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,865 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 04:33:42,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:42,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:42,869 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:42,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:42,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:42,892 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:185, output treesize:44 [2021-06-05 04:33:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:42,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966313716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:42,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:42,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:33:42,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304748783] [2021-06-05 04:33:42,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:33:42,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:42,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:33:42,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:33:42,961 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:43,232 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2021-06-05 04:33:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:43,511 INFO L93 Difference]: Finished difference Result 1024 states and 3980 transitions. [2021-06-05 04:33:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:43,512 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 04:33:43,512 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 04:33:43,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 679.0ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 04:33:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 980. [2021-06-05 04:33:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 04:33:43,522 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 04:33:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:43,523 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 04:33:43,523 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 04:33:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:43,524 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:43,524 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:43,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5681,446 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:43,724 INFO L430 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash 805372912, now seen corresponding path program 300 times [2021-06-05 04:33:43,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:43,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140993254] [2021-06-05 04:33:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:44,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:44,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140993254] [2021-06-05 04:33:44,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140993254] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:44,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112402860] [2021-06-05 04:33:44,104 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:44,130 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:33:44,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:44,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:44,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:44,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:44,218 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,221 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:44,222 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:44,225 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:44,229 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:44,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:44,264 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 04:33:44,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:44,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:44,381 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:44,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:44,384 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:44,387 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:44,422 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 04:33:44,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:44,426 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:44,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:44,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:44,440 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 04:33:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:44,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112402860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:44,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:44,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:33:44,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013154213] [2021-06-05 04:33:44,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:33:44,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:33:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:44,499 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:44,957 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-06-05 04:33:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:45,571 INFO L93 Difference]: Finished difference Result 1038 states and 4005 transitions. [2021-06-05 04:33:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:33:45,571 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:45,573 INFO L225 Difference]: With dead ends: 1038 [2021-06-05 04:33:45,573 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 04:33:45,573 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1155.1ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:33:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 04:33:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 978. [2021-06-05 04:33:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:45,584 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:45,584 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:45,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:45,585 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:45,585 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:45,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5711,447 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:45,785 INFO L430 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash 126667614, now seen corresponding path program 301 times [2021-06-05 04:33:45,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:45,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132364059] [2021-06-05 04:33:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:46,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:46,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132364059] [2021-06-05 04:33:46,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132364059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:46,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611854759] [2021-06-05 04:33:46,471 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:46,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 04:33:46,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:46,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:46,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:46,614 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:46,617 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:46,620 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:46,661 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:46,661 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 04:33:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:46,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:46,787 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:46,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:46,791 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:46,793 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,829 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 04:33:46,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:46,832 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:46,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:46,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:46,846 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:46,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611854759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:46,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:46,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 04:33:46,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898988928] [2021-06-05 04:33:46,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 04:33:46,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 04:33:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:33:46,918 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:47,421 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 04:33:47,632 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 04:33:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:48,001 INFO L93 Difference]: Finished difference Result 1019 states and 3955 transitions. [2021-06-05 04:33:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:48,001 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:48,003 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 04:33:48,003 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 04:33:48,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1501.8ms TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:33:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 04:33:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 978. [2021-06-05 04:33:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 04:33:48,013 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 04:33:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:48,013 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 04:33:48,013 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 04:33:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:48,015 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:48,015 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:48,215 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 448 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5725 [2021-06-05 04:33:48,215 INFO L430 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash -884569992, now seen corresponding path program 302 times [2021-06-05 04:33:48,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:48,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939859693] [2021-06-05 04:33:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:48,591 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 04:33:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:48,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:48,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939859693] [2021-06-05 04:33:48,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939859693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:48,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152232843] [2021-06-05 04:33:48,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:48,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:33:48,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:48,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:48,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:49,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:49,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:49,021 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:49,025 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:49,028 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:49,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:49,080 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:33:49,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:49,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:49,281 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:49,305 INFO L628 ElimStorePlain]: treesize reduction 54, result has 35.7 percent of original size [2021-06-05 04:33:49,305 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:33:49,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:49,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:49,308 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:49,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:49,316 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:49,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:49,317 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 04:33:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:49,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152232843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:49,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:49,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 04:33:49,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697431619] [2021-06-05 04:33:49,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:33:49,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:49,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:33:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:49,347 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:49,949 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2021-06-05 04:33:50,226 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 58 [2021-06-05 04:33:50,564 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 65 [2021-06-05 04:33:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:50,705 INFO L93 Difference]: Finished difference Result 1068 states and 4102 transitions. [2021-06-05 04:33:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:33:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:50,707 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 04:33:50,707 INFO L226 Difference]: Without dead ends: 1058 [2021-06-05 04:33:50,708 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1799.1ms TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:33:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2021-06-05 04:33:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 972. [2021-06-05 04:33:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 04:33:50,718 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 04:33:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:50,718 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 04:33:50,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 04:33:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:50,719 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:50,719 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:50,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5739,449 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:50,920 INFO L430 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1041749102, now seen corresponding path program 303 times [2021-06-05 04:33:50,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:50,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810541658] [2021-06-05 04:33:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:51,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:51,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810541658] [2021-06-05 04:33:51,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810541658] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:51,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681740298] [2021-06-05 04:33:51,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:51,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:33:51,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:51,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:51,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:51,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:51,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:51,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:51,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:51,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:51,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:51,502 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:51,506 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:51,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:51,565 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 04:33:51,721 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1166], 1=[array_4, v_prenex_1167]} [2021-06-05 04:33:51,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:51,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:51,730 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,783 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 04:33:51,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:51,787 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:51,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:51,805 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:51,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:51,809 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:51,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:51,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:51,827 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:51,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681740298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:51,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:51,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 04:33:51,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834524949] [2021-06-05 04:33:51,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 04:33:51,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:51,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 04:33:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:33:51,909 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:52,459 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-06-05 04:33:52,620 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-06-05 04:33:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:53,012 INFO L93 Difference]: Finished difference Result 1048 states and 4045 transitions. [2021-06-05 04:33:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:33:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:53,014 INFO L225 Difference]: With dead ends: 1048 [2021-06-05 04:33:53,014 INFO L226 Difference]: Without dead ends: 1038 [2021-06-05 04:33:53,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1267.3ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:33:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-06-05 04:33:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 972. [2021-06-05 04:33:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 04:33:53,032 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 04:33:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:53,032 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 04:33:53,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 04:33:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:53,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:53,033 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:53,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5754,450 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:53,234 INFO L430 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:53,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1952554566, now seen corresponding path program 304 times [2021-06-05 04:33:53,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:53,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897306145] [2021-06-05 04:33:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:53,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:53,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897306145] [2021-06-05 04:33:53,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897306145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:53,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920439498] [2021-06-05 04:33:53,711 INFO L93 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 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:53,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:33:53,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:53,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 04:33:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:53,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:53,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:53,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:53,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:53,839 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:53,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:53,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:53,842 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:53,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:53,845 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:53,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:53,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:53,880 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 04:33:54,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:54,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:54,040 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:54,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:54,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:54,044 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:54,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:54,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:54,047 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:54,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:33:54,051 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:54,107 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 04:33:54,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:33:54,110 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:54,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:54,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:54,133 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 04:33:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:54,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920439498] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:54,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:54,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 04:33:54,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834739429] [2021-06-05 04:33:54,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 04:33:54,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 04:33:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:33:54,255 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:54,726 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 04:33:55,063 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2021-06-05 04:33:55,256 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2021-06-05 04:33:55,441 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2021-06-05 04:33:55,614 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2021-06-05 04:33:55,772 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2021-06-05 04:33:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:56,002 INFO L93 Difference]: Finished difference Result 1278 states and 4854 transitions. [2021-06-05 04:33:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:33:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:56,004 INFO L225 Difference]: With dead ends: 1278 [2021-06-05 04:33:56,005 INFO L226 Difference]: Without dead ends: 1256 [2021-06-05 04:33:56,005 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2023.7ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 04:33:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2021-06-05 04:33:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 984. [2021-06-05 04:33:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9389623601220753) internal successors, (3872), 983 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3872 transitions. [2021-06-05 04:33:56,017 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3872 transitions. Word has length 18 [2021-06-05 04:33:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:56,017 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3872 transitions. [2021-06-05 04:33:56,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3872 transitions. [2021-06-05 04:33:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:56,018 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:56,018 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:56,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5769,451 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:56,219 INFO L430 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash -677605888, now seen corresponding path program 305 times [2021-06-05 04:33:56,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:56,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740219636] [2021-06-05 04:33:56,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:56,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:56,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740219636] [2021-06-05 04:33:56,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740219636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:56,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025627992] [2021-06-05 04:33:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:56,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:33:56,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:56,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:56,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:56,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:56,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:56,634 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:56,637 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:56,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:56,664 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:56,664 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 04:33:56,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:56,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:33:56,806 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:56,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:56,809 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:56,812 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:56,847 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 04:33:56,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:56,851 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:56,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:56,865 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:56,865 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 04:33:56,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:56,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025627992] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:56,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:56,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:33:56,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474897535] [2021-06-05 04:33:56,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:33:56,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:33:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:33:56,929 INFO L87 Difference]: Start difference. First operand 984 states and 3872 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:57,439 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-06-05 04:33:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:33:57,964 INFO L93 Difference]: Finished difference Result 1164 states and 4532 transitions. [2021-06-05 04:33:57,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:33:57,964 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:33:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:33:57,966 INFO L225 Difference]: With dead ends: 1164 [2021-06-05 04:33:57,966 INFO L226 Difference]: Without dead ends: 1159 [2021-06-05 04:33:57,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1101.7ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:33:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-06-05 04:33:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 982. [2021-06-05 04:33:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.9429153924566767) internal successors, (3868), 981 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3868 transitions. [2021-06-05 04:33:57,977 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3868 transitions. Word has length 18 [2021-06-05 04:33:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:33:57,978 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3868 transitions. [2021-06-05 04:33:57,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3868 transitions. [2021-06-05 04:33:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:33:57,979 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:33:57,979 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:33:58,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 452 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5782 [2021-06-05 04:33:58,180 INFO L430 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:33:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:33:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1248428190, now seen corresponding path program 306 times [2021-06-05 04:33:58,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:33:58,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908568491] [2021-06-05 04:33:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:33:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:33:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:58,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:33:58,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908568491] [2021-06-05 04:33:58,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908568491] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:58,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800236958] [2021-06-05 04:33:58,431 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:33:58,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:33:58,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:33:58,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:33:58,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:33:58,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:33:58,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:58,623 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:58,628 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:33:58,633 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:58,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:33:58,700 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 04:33:58,852 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1168], 1=[array_4, v_prenex_1169]} [2021-06-05 04:33:58,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:33:58,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:33:58,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,906 INFO L628 ElimStorePlain]: treesize reduction 81, result has 42.6 percent of original size [2021-06-05 04:33:58,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 04:33:58,909 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:33:58,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:58,926 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:33:58,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:33:58,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 04:33:58,930 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 04:33:58,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:33:58,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:33:58,947 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 04:33:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:33:59,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800236958] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:33:59,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:33:59,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:33:59,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098334467] [2021-06-05 04:33:59,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:33:59,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:33:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:33:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:33:59,018 INFO L87 Difference]: Start difference. First operand 982 states and 3868 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:33:59,473 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-06-05 04:34:00,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:00,095 INFO L93 Difference]: Finished difference Result 1157 states and 4510 transitions. [2021-06-05 04:34:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:34:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:00,097 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 04:34:00,097 INFO L226 Difference]: Without dead ends: 1147 [2021-06-05 04:34:00,097 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1212.4ms TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-06-05 04:34:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 981. [2021-06-05 04:34:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9448979591836735) internal successors, (3866), 980 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3866 transitions. [2021-06-05 04:34:00,109 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3866 transitions. Word has length 18 [2021-06-05 04:34:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:00,109 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3866 transitions. [2021-06-05 04:34:00,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3866 transitions. [2021-06-05 04:34:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 04:34:00,110 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:00,110 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:00,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5796,453 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:00,311 INFO L430 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -19028988, now seen corresponding path program 307 times [2021-06-05 04:34:00,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:00,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333106349] [2021-06-05 04:34:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:00,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:00,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333106349] [2021-06-05 04:34:00,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333106349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:00,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225171916] [2021-06-05 04:34:00,505 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:00,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 04:34:00,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:00,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:34:00,673 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:00,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 04:34:00,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:00,685 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:00,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 04:34:00,737 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:167, output treesize:135 [2021-06-05 04:34:00,894 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 04:34:00,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:34:00,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 04:34:00,901 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:00,905 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 04:34:00,908 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,959 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 04:34:00,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:00,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 04:34:00,962 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:00,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:00,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:00,982 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 04:34:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:01,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225171916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:01,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:01,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:34:01,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189783824] [2021-06-05 04:34:01,055 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:34:01,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:34:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:34:01,055 INFO L87 Difference]: Start difference. First operand 981 states and 3866 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:01,541 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2021-06-05 04:34:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:01,972 INFO L93 Difference]: Finished difference Result 1160 states and 4546 transitions. [2021-06-05 04:34:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 04:34:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:01,974 INFO L225 Difference]: With dead ends: 1160 [2021-06-05 04:34:01,974 INFO L226 Difference]: Without dead ends: 1155 [2021-06-05 04:34:01,974 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 862.3ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-06-05 04:34:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 975. [2021-06-05 04:34:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.9507186858316223) internal successors, (3848), 974 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3848 transitions. [2021-06-05 04:34:01,985 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3848 transitions. Word has length 18 [2021-06-05 04:34:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:01,985 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3848 transitions. [2021-06-05 04:34:01,985 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3848 transitions. [2021-06-05 04:34:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:01,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:01,987 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:02,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 454 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5811 [2021-06-05 04:34:02,187 INFO L430 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1736350512, now seen corresponding path program 308 times [2021-06-05 04:34:02,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:02,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042117527] [2021-06-05 04:34:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:02,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:02,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042117527] [2021-06-05 04:34:02,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042117527] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:02,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557336079] [2021-06-05 04:34:02,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:02,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:02,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:02,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:02,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:02,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:02,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:02,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:02,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:02,382 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:02,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:02,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:02,394 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:02,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:02,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:02,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:02,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:02,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:02,473 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:02,473 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:02,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:02,474 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:02,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557336079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:02,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:02,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:02,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146504070] [2021-06-05 04:34:02,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:02,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:02,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:02,493 INFO L87 Difference]: Start difference. First operand 975 states and 3848 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:02,897 INFO L93 Difference]: Finished difference Result 1265 states and 4852 transitions. [2021-06-05 04:34:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:02,899 INFO L225 Difference]: With dead ends: 1265 [2021-06-05 04:34:02,899 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 04:34:02,899 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 305.3ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 04:34:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 988. [2021-06-05 04:34:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.951367781155015) internal successors, (3900), 987 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3900 transitions. [2021-06-05 04:34:02,911 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3900 transitions. Word has length 19 [2021-06-05 04:34:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:02,911 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3900 transitions. [2021-06-05 04:34:02,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3900 transitions. [2021-06-05 04:34:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:02,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:02,912 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:03,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 455 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5829 [2021-06-05 04:34:03,113 INFO L430 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1780604390, now seen corresponding path program 309 times [2021-06-05 04:34:03,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:03,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994425441] [2021-06-05 04:34:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:03,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:03,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994425441] [2021-06-05 04:34:03,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994425441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:03,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379638433] [2021-06-05 04:34:03,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:03,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:34:03,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:03,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:03,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:03,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:03,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:03,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:03,250 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:03,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:03,262 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:03,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:03,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:03,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,310 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:03,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:03,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:03,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:03,328 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:03,328 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:03,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:03,329 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:03,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379638433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:03,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:03,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 04:34:03,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256155738] [2021-06-05 04:34:03,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:34:03,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:03,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:34:03,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:34:03,347 INFO L87 Difference]: Start difference. First operand 988 states and 3900 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:03,673 INFO L93 Difference]: Finished difference Result 1177 states and 4540 transitions. [2021-06-05 04:34:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:03,675 INFO L225 Difference]: With dead ends: 1177 [2021-06-05 04:34:03,675 INFO L226 Difference]: Without dead ends: 1163 [2021-06-05 04:34:03,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 286.5ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-06-05 04:34:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 988. [2021-06-05 04:34:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.9463019250253293) internal successors, (3895), 987 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3895 transitions. [2021-06-05 04:34:03,687 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3895 transitions. Word has length 19 [2021-06-05 04:34:03,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:03,687 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3895 transitions. [2021-06-05 04:34:03,687 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3895 transitions. [2021-06-05 04:34:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:03,688 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:03,688 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:03,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5832,456 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:03,889 INFO L430 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:03,889 INFO L82 PathProgramCache]: Analyzing trace with hash 609550430, now seen corresponding path program 310 times [2021-06-05 04:34:03,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:03,889 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813977321] [2021-06-05 04:34:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:04,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:04,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813977321] [2021-06-05 04:34:04,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813977321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:04,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318380414] [2021-06-05 04:34:04,022 INFO L93 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 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:04,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:04,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:04,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:04,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:04,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:04,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:04,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:04,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:04,126 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:04,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:04,138 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:04,138 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:04,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:04,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:04,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:04,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:04,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:04,229 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:04,229 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:04,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:04,229 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:04,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318380414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:04,248 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:04,248 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:04,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882417882] [2021-06-05 04:34:04,248 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:04,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:04,249 INFO L87 Difference]: Start difference. First operand 988 states and 3895 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:04,673 INFO L93 Difference]: Finished difference Result 1184 states and 4571 transitions. [2021-06-05 04:34:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:04,675 INFO L225 Difference]: With dead ends: 1184 [2021-06-05 04:34:04,675 INFO L226 Difference]: Without dead ends: 1184 [2021-06-05 04:34:04,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 370.9ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-06-05 04:34:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 991. [2021-06-05 04:34:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9464646464646465) internal successors, (3907), 990 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3907 transitions. [2021-06-05 04:34:04,686 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3907 transitions. Word has length 19 [2021-06-05 04:34:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:04,686 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3907 transitions. [2021-06-05 04:34:04,686 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3907 transitions. [2021-06-05 04:34:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:04,688 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:04,688 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:04,888 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 457 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5838 [2021-06-05 04:34:04,888 INFO L430 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -999033840, now seen corresponding path program 311 times [2021-06-05 04:34:04,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:04,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561286526] [2021-06-05 04:34:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:04,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:04,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561286526] [2021-06-05 04:34:04,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561286526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:04,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422806081] [2021-06-05 04:34:04,955 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:04,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:04,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:04,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:04,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:05,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:05,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:05,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:05,042 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:05,042 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 04:34:05,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:05,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:05,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:05,116 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:05,118 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:05,120 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,134 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:05,134 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:05,134 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:05,134 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:05,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422806081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:05,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:05,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:05,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315501468] [2021-06-05 04:34:05,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:05,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:05,153 INFO L87 Difference]: Start difference. First operand 991 states and 3907 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:05,494 INFO L93 Difference]: Finished difference Result 1189 states and 4580 transitions. [2021-06-05 04:34:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:05,496 INFO L225 Difference]: With dead ends: 1189 [2021-06-05 04:34:05,496 INFO L226 Difference]: Without dead ends: 1181 [2021-06-05 04:34:05,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 331.3ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:34:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-06-05 04:34:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 991. [2021-06-05 04:34:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9434343434343435) internal successors, (3904), 990 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3904 transitions. [2021-06-05 04:34:05,507 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3904 transitions. Word has length 19 [2021-06-05 04:34:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:05,507 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3904 transitions. [2021-06-05 04:34:05,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3904 transitions. [2021-06-05 04:34:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:05,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:05,509 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:05,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5841,458 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:05,709 INFO L430 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:05,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2090788300, now seen corresponding path program 312 times [2021-06-05 04:34:05,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:05,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640995435] [2021-06-05 04:34:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:05,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:05,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640995435] [2021-06-05 04:34:05,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640995435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:05,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505359567] [2021-06-05 04:34:05,819 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:05,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:05,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:05,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:05,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:05,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:05,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:05,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:05,914 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:05,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:05,926 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:05,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:05,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:05,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:05,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:05,989 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:05,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:05,992 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:05,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:05,994 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:06,025 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:06,025 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:06,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:06,025 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:06,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505359567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:06,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:06,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:06,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458702849] [2021-06-05 04:34:06,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:06,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:06,074 INFO L87 Difference]: Start difference. First operand 991 states and 3904 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:06,679 INFO L93 Difference]: Finished difference Result 1217 states and 4654 transitions. [2021-06-05 04:34:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:06,681 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 04:34:06,681 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 04:34:06,681 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 514.1ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 04:34:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 994. [2021-06-05 04:34:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9466263846928498) internal successors, (3919), 993 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3919 transitions. [2021-06-05 04:34:06,692 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3919 transitions. Word has length 19 [2021-06-05 04:34:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:06,692 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3919 transitions. [2021-06-05 04:34:06,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3919 transitions. [2021-06-05 04:34:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:06,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:06,694 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:06,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5847,459 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:06,894 INFO L430 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1009142822, now seen corresponding path program 313 times [2021-06-05 04:34:06,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:06,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922759356] [2021-06-05 04:34:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:06,974 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:06,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922759356] [2021-06-05 04:34:06,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922759356] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:06,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226790973] [2021-06-05 04:34:06,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:07,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:07,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:07,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:07,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:07,048 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:07,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:07,061 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 04:34:07,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:07,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:07,118 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:07,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:07,121 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:07,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:07,124 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:07,127 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:07,158 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:07,158 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:07,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:07,159 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:07,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226790973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:07,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:07,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:07,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569567780] [2021-06-05 04:34:07,213 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:07,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:07,213 INFO L87 Difference]: Start difference. First operand 994 states and 3919 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:07,790 INFO L93 Difference]: Finished difference Result 1208 states and 4629 transitions. [2021-06-05 04:34:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:07,792 INFO L225 Difference]: With dead ends: 1208 [2021-06-05 04:34:07,792 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 04:34:07,792 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 510.5ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 04:34:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 998. [2021-06-05 04:34:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.945837512537613) internal successors, (3934), 997 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3934 transitions. [2021-06-05 04:34:07,804 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3934 transitions. Word has length 19 [2021-06-05 04:34:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:07,804 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3934 transitions. [2021-06-05 04:34:07,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3934 transitions. [2021-06-05 04:34:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:07,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:07,805 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:08,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5852,460 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:08,006 INFO L430 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 419812284, now seen corresponding path program 314 times [2021-06-05 04:34:08,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:08,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209023974] [2021-06-05 04:34:08,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:08,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:08,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209023974] [2021-06-05 04:34:08,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209023974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:08,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516435902] [2021-06-05 04:34:08,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:08,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:08,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:08,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:08,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:08,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:08,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:08,204 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:08,206 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,217 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:08,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:08,218 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:08,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:08,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:08,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:08,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:08,280 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:08,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:08,283 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:08,285 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:08,315 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:08,315 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:08,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:08,316 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:08,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516435902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:08,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:08,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:08,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235659825] [2021-06-05 04:34:08,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:08,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:08,373 INFO L87 Difference]: Start difference. First operand 998 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:08,953 INFO L93 Difference]: Finished difference Result 1200 states and 4622 transitions. [2021-06-05 04:34:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:08,955 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 04:34:08,955 INFO L226 Difference]: Without dead ends: 1197 [2021-06-05 04:34:08,955 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 528.5ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-06-05 04:34:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 998. [2021-06-05 04:34:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.9428284854563693) internal successors, (3931), 997 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3931 transitions. [2021-06-05 04:34:08,967 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3931 transitions. Word has length 19 [2021-06-05 04:34:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:08,967 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3931 transitions. [2021-06-05 04:34:08,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3931 transitions. [2021-06-05 04:34:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:08,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:08,968 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:09,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 461 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5859 [2021-06-05 04:34:09,169 INFO L430 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1345835728, now seen corresponding path program 315 times [2021-06-05 04:34:09,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:09,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341576330] [2021-06-05 04:34:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:09,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:09,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341576330] [2021-06-05 04:34:09,248 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341576330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:09,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807928152] [2021-06-05 04:34:09,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:09,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:34:09,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:09,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:09,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:09,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:09,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:09,323 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:09,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:09,335 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 04:34:09,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:09,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:09,402 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:09,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:09,405 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:09,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:09,408 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:09,411 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:09,442 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:09,443 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:09,443 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:09,443 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:09,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807928152] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:09,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:09,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:09,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008246390] [2021-06-05 04:34:09,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:09,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:09,488 INFO L87 Difference]: Start difference. First operand 998 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:09,938 INFO L93 Difference]: Finished difference Result 1190 states and 4592 transitions. [2021-06-05 04:34:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:09,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:09,940 INFO L225 Difference]: With dead ends: 1190 [2021-06-05 04:34:09,940 INFO L226 Difference]: Without dead ends: 1190 [2021-06-05 04:34:09,940 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 405.4ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:34:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2021-06-05 04:34:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 994. [2021-06-05 04:34:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9405840886203425) internal successors, (3913), 993 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3913 transitions. [2021-06-05 04:34:09,951 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3913 transitions. Word has length 19 [2021-06-05 04:34:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:09,951 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3913 transitions. [2021-06-05 04:34:09,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3913 transitions. [2021-06-05 04:34:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:09,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:09,952 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:10,153 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 462 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5866 [2021-06-05 04:34:10,153 INFO L430 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -463534950, now seen corresponding path program 316 times [2021-06-05 04:34:10,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:10,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027314304] [2021-06-05 04:34:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:10,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:10,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027314304] [2021-06-05 04:34:10,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027314304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:10,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878144321] [2021-06-05 04:34:10,254 INFO L93 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 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:10,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:10,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:10,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:10,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:10,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:10,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:10,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:10,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:10,366 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:10,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:10,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:10,381 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:10,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:10,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:10,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:10,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:10,435 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:10,449 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:10,449 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:10,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:10,449 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:10,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878144321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:10,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:10,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:10,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439983474] [2021-06-05 04:34:10,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:10,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:10,469 INFO L87 Difference]: Start difference. First operand 994 states and 3913 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:10,829 INFO L93 Difference]: Finished difference Result 1097 states and 4258 transitions. [2021-06-05 04:34:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:10,831 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 04:34:10,831 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 04:34:10,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 299.6ms TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 04:34:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1000. [2021-06-05 04:34:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 04:34:10,843 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 04:34:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:10,843 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 04:34:10,843 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 04:34:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:10,844 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:10,844 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:11,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 463 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5871 [2021-06-05 04:34:11,044 INFO L430 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2072119220, now seen corresponding path program 317 times [2021-06-05 04:34:11,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:11,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758507070] [2021-06-05 04:34:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:11,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:11,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758507070] [2021-06-05 04:34:11,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758507070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:11,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246157429] [2021-06-05 04:34:11,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:11,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:11,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:11,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:11,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:11,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:11,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:11,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:11,211 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,225 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:11,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:11,226 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:11,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:11,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:11,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:11,286 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:11,289 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:11,290 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:11,304 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:11,304 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:11,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:11,304 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:11,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246157429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:11,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:11,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:11,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428286948] [2021-06-05 04:34:11,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:11,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:11,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:11,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:11,322 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:11,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:11,618 INFO L93 Difference]: Finished difference Result 1087 states and 4222 transitions. [2021-06-05 04:34:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:11,620 INFO L225 Difference]: With dead ends: 1087 [2021-06-05 04:34:11,620 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 04:34:11,620 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 250.2ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 04:34:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1000. [2021-06-05 04:34:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 04:34:11,631 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 04:34:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:11,631 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 04:34:11,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 04:34:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:11,632 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:11,632 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:11,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5874,464 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:11,833 INFO L430 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702920, now seen corresponding path program 318 times [2021-06-05 04:34:11,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:11,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798855572] [2021-06-05 04:34:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:11,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:11,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798855572] [2021-06-05 04:34:11,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798855572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:11,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739412730] [2021-06-05 04:34:11,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:11,967 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:11,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:11,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:12,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:12,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:12,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:12,054 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:12,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:12,068 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:12,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:12,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:12,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:12,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:12,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:12,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:12,112 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:12,114 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:12,144 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:12,144 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:12,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:12,145 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:12,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739412730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:12,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:12,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:12,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639139253] [2021-06-05 04:34:12,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:12,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:12,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:12,193 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:12,662 INFO L93 Difference]: Finished difference Result 1096 states and 4256 transitions. [2021-06-05 04:34:12,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:12,664 INFO L225 Difference]: With dead ends: 1096 [2021-06-05 04:34:12,664 INFO L226 Difference]: Without dead ends: 1096 [2021-06-05 04:34:12,664 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 418.2ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-06-05 04:34:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1003. [2021-06-05 04:34:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.932135728542914) internal successors, (3940), 1002 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3940 transitions. [2021-06-05 04:34:12,675 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3940 transitions. Word has length 19 [2021-06-05 04:34:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:12,675 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3940 transitions. [2021-06-05 04:34:12,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3940 transitions. [2021-06-05 04:34:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:12,676 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:12,676 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:12,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 465 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5881 [2021-06-05 04:34:12,877 INFO L430 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash 272750348, now seen corresponding path program 319 times [2021-06-05 04:34:12,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:12,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780185169] [2021-06-05 04:34:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:12,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:12,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780185169] [2021-06-05 04:34:12,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780185169] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:12,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581537357] [2021-06-05 04:34:12,952 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:12,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:12,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:13,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:13,040 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:13,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:13,056 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 04:34:13,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:13,094 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,097 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:13,100 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,131 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:13,132 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:13,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:13,132 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:13,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581537357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:13,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:13,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:13,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779458611] [2021-06-05 04:34:13,176 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:13,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:13,176 INFO L87 Difference]: Start difference. First operand 1003 states and 3940 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:13,442 INFO L93 Difference]: Finished difference Result 1088 states and 4234 transitions. [2021-06-05 04:34:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:13,444 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 04:34:13,444 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 04:34:13,445 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 262.9ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 04:34:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 997. [2021-06-05 04:34:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 3.9377510040160644) internal successors, (3922), 996 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3922 transitions. [2021-06-05 04:34:13,455 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3922 transitions. Word has length 19 [2021-06-05 04:34:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:13,455 INFO L482 AbstractCegarLoop]: Abstraction has 997 states and 3922 transitions. [2021-06-05 04:34:13,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3922 transitions. [2021-06-05 04:34:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:13,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:13,457 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:13,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5886,466 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:13,657 INFO L430 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -298454384, now seen corresponding path program 320 times [2021-06-05 04:34:13,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:13,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107514854] [2021-06-05 04:34:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:13,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:13,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107514854] [2021-06-05 04:34:13,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107514854] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:13,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935220110] [2021-06-05 04:34:13,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:13,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:13,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:13,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:13,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:13,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:13,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:13,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:13,894 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:13,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:13,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:13,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:13,939 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:13,941 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:13,971 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:13,971 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:13,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:13,972 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:14,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935220110] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:14,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:14,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:14,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832565452] [2021-06-05 04:34:14,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:14,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:14,021 INFO L87 Difference]: Start difference. First operand 997 states and 3922 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:14,499 INFO L93 Difference]: Finished difference Result 1119 states and 4310 transitions. [2021-06-05 04:34:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:14,501 INFO L225 Difference]: With dead ends: 1119 [2021-06-05 04:34:14,501 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 04:34:14,501 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 409.7ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 04:34:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1003. [2021-06-05 04:34:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.9411177644710578) internal successors, (3949), 1002 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3949 transitions. [2021-06-05 04:34:14,512 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3949 transitions. Word has length 19 [2021-06-05 04:34:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:14,512 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3949 transitions. [2021-06-05 04:34:14,512 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3949 transitions. [2021-06-05 04:34:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:14,514 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:14,514 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:14,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5891,467 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:14,714 INFO L430 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 896581790, now seen corresponding path program 321 times [2021-06-05 04:34:14,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:14,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756589981] [2021-06-05 04:34:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:14,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:14,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756589981] [2021-06-05 04:34:14,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756589981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:14,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538376670] [2021-06-05 04:34:14,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:14,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:34:14,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:14,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:14,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:14,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:14,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:14,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:14,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:14,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:14,889 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:14,922 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:34:14,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:14,925 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:14,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:14,931 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:14,933 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:14,965 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:14,965 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:14,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:14,965 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:15,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538376670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:15,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:15,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:15,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23855391] [2021-06-05 04:34:15,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:15,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:15,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:15,020 INFO L87 Difference]: Start difference. First operand 1003 states and 3949 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:15,344 INFO L93 Difference]: Finished difference Result 1109 states and 4280 transitions. [2021-06-05 04:34:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:15,346 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 04:34:15,346 INFO L226 Difference]: Without dead ends: 1105 [2021-06-05 04:34:15,346 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 312.5ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:34:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-06-05 04:34:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1007. [2021-06-05 04:34:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9403578528827037) internal successors, (3964), 1006 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3964 transitions. [2021-06-05 04:34:15,357 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3964 transitions. Word has length 19 [2021-06-05 04:34:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:15,357 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3964 transitions. [2021-06-05 04:34:15,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3964 transitions. [2021-06-05 04:34:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:15,358 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:15,358 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:15,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5896,468 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:15,559 INFO L430 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1969430400, now seen corresponding path program 322 times [2021-06-05 04:34:15,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:15,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091266934] [2021-06-05 04:34:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:15,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:15,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091266934] [2021-06-05 04:34:15,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091266934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:15,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640068465] [2021-06-05 04:34:15,665 INFO L93 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 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:15,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:15,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:15,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:15,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:15,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:15,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:15,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:15,777 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:15,791 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:15,791 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:15,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:15,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:15,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:15,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:15,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:15,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:15,835 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:15,838 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:15,878 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:15,878 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:15,878 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:15,878 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:15,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:15,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640068465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:15,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:15,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:15,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287202640] [2021-06-05 04:34:15,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:15,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:15,937 INFO L87 Difference]: Start difference. First operand 1007 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:16,355 INFO L93 Difference]: Finished difference Result 1122 states and 4320 transitions. [2021-06-05 04:34:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:16,358 INFO L225 Difference]: With dead ends: 1122 [2021-06-05 04:34:16,358 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 04:34:16,358 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 424.8ms TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 04:34:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1007. [2021-06-05 04:34:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9373757455268388) internal successors, (3961), 1006 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3961 transitions. [2021-06-05 04:34:16,369 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3961 transitions. Word has length 19 [2021-06-05 04:34:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:16,369 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3961 transitions. [2021-06-05 04:34:16,369 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3961 transitions. [2021-06-05 04:34:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:16,371 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:16,371 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:16,571 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5903,469 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:16,571 INFO L430 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1043406956, now seen corresponding path program 323 times [2021-06-05 04:34:16,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:16,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449419562] [2021-06-05 04:34:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:16,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:16,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449419562] [2021-06-05 04:34:16,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449419562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:16,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173672003] [2021-06-05 04:34:16,645 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:16,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:34:16,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:16,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:16,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:16,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:16,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:16,734 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:16,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:16,750 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:16,784 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:34:16,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:16,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:16,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:16,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:16,794 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:16,826 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:16,826 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:16,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:16,827 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:16,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173672003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:16,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:16,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:16,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686777645] [2021-06-05 04:34:16,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:16,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:16,872 INFO L87 Difference]: Start difference. First operand 1007 states and 3961 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:17,173 INFO L93 Difference]: Finished difference Result 1094 states and 4249 transitions. [2021-06-05 04:34:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:17,176 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 04:34:17,176 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 04:34:17,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 258.2ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 04:34:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1000. [2021-06-05 04:34:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 04:34:17,186 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 04:34:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:17,187 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 04:34:17,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 04:34:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:17,188 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:17,188 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:17,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5910,470 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:17,388 INFO L430 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash 596489562, now seen corresponding path program 324 times [2021-06-05 04:34:17,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:17,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926540980] [2021-06-05 04:34:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:17,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:17,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926540980] [2021-06-05 04:34:17,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926540980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:17,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958027535] [2021-06-05 04:34:17,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:17,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:17,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:17,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:17,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:17,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:17,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:17,608 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:17,622 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:17,622 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:17,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:17,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:17,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:17,689 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:17,692 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:17,694 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:17,710 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 04:34:17,710 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:17,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:17,710 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:17,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958027535] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:17,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:17,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:17,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732699710] [2021-06-05 04:34:17,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:17,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:17,732 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:18,145 INFO L93 Difference]: Finished difference Result 1088 states and 4228 transitions. [2021-06-05 04:34:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:18,147 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 04:34:18,147 INFO L226 Difference]: Without dead ends: 1082 [2021-06-05 04:34:18,148 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 387.3ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2021-06-05 04:34:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1000. [2021-06-05 04:34:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 04:34:18,158 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 04:34:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:18,158 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 04:34:18,158 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 04:34:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:18,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:18,159 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:18,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 471 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5915 [2021-06-05 04:34:18,360 INFO L430 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1917147636, now seen corresponding path program 325 times [2021-06-05 04:34:18,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:18,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116470763] [2021-06-05 04:34:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:18,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:18,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116470763] [2021-06-05 04:34:18,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116470763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:18,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236252298] [2021-06-05 04:34:18,431 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:18,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:18,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:18,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:18,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:18,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:18,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:18,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:18,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:18,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:18,542 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:18,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:18,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:18,590 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:18,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:18,593 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:18,607 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:18,607 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:18,607 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:18,607 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:18,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236252298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:18,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:18,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:18,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059629082] [2021-06-05 04:34:18,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:18,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:18,626 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:18,869 INFO L93 Difference]: Finished difference Result 1091 states and 4243 transitions. [2021-06-05 04:34:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:18,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:18,871 INFO L225 Difference]: With dead ends: 1091 [2021-06-05 04:34:18,871 INFO L226 Difference]: Without dead ends: 1091 [2021-06-05 04:34:18,871 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 206.1ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-06-05 04:34:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1003. [2021-06-05 04:34:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.935129740518962) internal successors, (3943), 1002 states have internal predecessors, (3943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3943 transitions. [2021-06-05 04:34:18,882 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3943 transitions. Word has length 19 [2021-06-05 04:34:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:18,882 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3943 transitions. [2021-06-05 04:34:18,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3943 transitions. [2021-06-05 04:34:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:18,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:18,883 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:19,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5922,472 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:19,084 INFO L430 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:19,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash -969881216, now seen corresponding path program 326 times [2021-06-05 04:34:19,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:19,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751733927] [2021-06-05 04:34:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:19,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:19,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751733927] [2021-06-05 04:34:19,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751733927] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:19,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366930509] [2021-06-05 04:34:19,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:19,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:19,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:19,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:19,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:19,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:19,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:19,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:19,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:19,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:19,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:19,325 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:19,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:19,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:19,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:19,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:19,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:19,394 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:19,394 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:19,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:19,394 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:19,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366930509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:19,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:19,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:19,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182408508] [2021-06-05 04:34:19,414 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:19,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:19,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:19,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:19,414 INFO L87 Difference]: Start difference. First operand 1003 states and 3943 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:19,738 INFO L93 Difference]: Finished difference Result 1106 states and 4284 transitions. [2021-06-05 04:34:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:19,740 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 04:34:19,740 INFO L226 Difference]: Without dead ends: 1106 [2021-06-05 04:34:19,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 310.4ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-06-05 04:34:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1012. [2021-06-05 04:34:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 04:34:19,751 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 04:34:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:19,751 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 04:34:19,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 04:34:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:19,753 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:19,753 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:19,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5925,473 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:19,953 INFO L430 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1716501810, now seen corresponding path program 327 times [2021-06-05 04:34:19,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:19,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610397920] [2021-06-05 04:34:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:20,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:20,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610397920] [2021-06-05 04:34:20,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610397920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:20,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159678309] [2021-06-05 04:34:20,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:20,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:34:20,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:20,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:20,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:20,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:20,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:20,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:20,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:20,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:20,120 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 04:34:20,178 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 04:34:20,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:20,180 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,182 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:20,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:20,184 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:20,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:20,200 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:20,200 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:20,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:20,200 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:20,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159678309] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:20,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:20,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:20,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525450719] [2021-06-05 04:34:20,219 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:20,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:20,219 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:20,560 INFO L93 Difference]: Finished difference Result 1102 states and 4266 transitions. [2021-06-05 04:34:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:20,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:20,562 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 04:34:20,562 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 04:34:20,562 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 275.8ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:34:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 04:34:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1012. [2021-06-05 04:34:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 04:34:20,573 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 04:34:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:20,573 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 04:34:20,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 04:34:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:20,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:20,574 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:20,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 474 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5928 [2021-06-05 04:34:20,774 INFO L430 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash 511356654, now seen corresponding path program 328 times [2021-06-05 04:34:20,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:20,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047032735] [2021-06-05 04:34:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:20,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:20,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047032735] [2021-06-05 04:34:20,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047032735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:20,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521969827] [2021-06-05 04:34:20,887 INFO L93 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 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:20,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:20,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:20,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:20,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:21,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:21,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:21,005 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:21,008 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:21,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:21,022 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:21,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:21,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:21,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:21,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:21,063 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:21,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:21,066 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:21,068 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,098 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:21,098 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:21,099 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:21,099 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:21,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521969827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:21,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:21,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:21,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835431576] [2021-06-05 04:34:21,147 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:21,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:21,147 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:21,551 INFO L93 Difference]: Finished difference Result 1098 states and 4262 transitions. [2021-06-05 04:34:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:21,552 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:21,553 INFO L225 Difference]: With dead ends: 1098 [2021-06-05 04:34:21,553 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 04:34:21,553 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 355.7ms TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 04:34:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1015. [2021-06-05 04:34:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.924063116370809) internal successors, (3979), 1014 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3979 transitions. [2021-06-05 04:34:21,564 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3979 transitions. Word has length 19 [2021-06-05 04:34:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:21,564 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3979 transitions. [2021-06-05 04:34:21,564 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3979 transitions. [2021-06-05 04:34:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:21,565 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:21,565 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:21,765 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5934,475 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:21,766 INFO L430 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -233595918, now seen corresponding path program 329 times [2021-06-05 04:34:21,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:21,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931925551] [2021-06-05 04:34:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:21,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:21,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931925551] [2021-06-05 04:34:21,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931925551] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:21,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421618571] [2021-06-05 04:34:21,841 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:21,867 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:34:21,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:21,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:21,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:21,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:21,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:21,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:21,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:21,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:21,944 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 04:34:21,977 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 04:34:21,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:21,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:21,983 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:21,985 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:21,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:21,988 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,018 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:22,018 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:22,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:22,019 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:22,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421618571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:22,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:22,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:22,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298898665] [2021-06-05 04:34:22,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:22,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:22,061 INFO L87 Difference]: Start difference. First operand 1015 states and 3979 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:22,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:22,432 INFO L93 Difference]: Finished difference Result 1109 states and 4296 transitions. [2021-06-05 04:34:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:22,434 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 04:34:22,434 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 04:34:22,434 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 313.1ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:34:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 04:34:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1009. [2021-06-05 04:34:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 04:34:22,446 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 04:34:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:22,446 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 04:34:22,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 04:34:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:22,448 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:22,448 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:22,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 476 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5939 [2021-06-05 04:34:22,648 INFO L430 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash -804800650, now seen corresponding path program 330 times [2021-06-05 04:34:22,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:22,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604383034] [2021-06-05 04:34:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:22,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:22,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604383034] [2021-06-05 04:34:22,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604383034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:22,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007561849] [2021-06-05 04:34:22,760 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:22,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:34:22,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:22,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:22,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:22,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:22,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:22,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:22,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:22,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:22,888 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:22,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:22,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:22,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:22,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:22,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:22,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:22,931 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:22,934 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:22,963 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:22,964 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:22,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:22,964 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:23,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007561849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:23,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:23,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:23,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41674566] [2021-06-05 04:34:23,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:23,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:23,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:23,013 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:23,386 INFO L93 Difference]: Finished difference Result 1118 states and 4307 transitions. [2021-06-05 04:34:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:23,386 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:23,388 INFO L225 Difference]: With dead ends: 1118 [2021-06-05 04:34:23,388 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 04:34:23,388 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 357.2ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 04:34:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1015. [2021-06-05 04:34:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.932938856015779) internal successors, (3988), 1014 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3988 transitions. [2021-06-05 04:34:23,399 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3988 transitions. Word has length 19 [2021-06-05 04:34:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:23,399 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3988 transitions. [2021-06-05 04:34:23,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3988 transitions. [2021-06-05 04:34:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:23,400 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:23,400 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:23,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5944,477 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:23,601 INFO L430 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:23,601 INFO L82 PathProgramCache]: Analyzing trace with hash 390235524, now seen corresponding path program 331 times [2021-06-05 04:34:23,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:23,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930304827] [2021-06-05 04:34:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:23,672 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:23,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930304827] [2021-06-05 04:34:23,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930304827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:23,672 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742922082] [2021-06-05 04:34:23,672 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:23,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:23,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:23,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:23,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:23,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:23,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:23,775 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:23,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:23,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:23,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:23,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:23,813 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:23,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:23,816 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:23,818 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:23,849 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:23,849 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:23,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:23,850 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:23,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742922082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:23,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:23,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:23,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987006690] [2021-06-05 04:34:23,903 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:23,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:23,903 INFO L87 Difference]: Start difference. First operand 1015 states and 3988 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:24,261 INFO L93 Difference]: Finished difference Result 1124 states and 4324 transitions. [2021-06-05 04:34:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:24,262 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:24,263 INFO L225 Difference]: With dead ends: 1124 [2021-06-05 04:34:24,263 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 04:34:24,264 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 345.0ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:34:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 04:34:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1019. [2021-06-05 04:34:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 04:34:24,274 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 04:34:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:24,274 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 04:34:24,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 04:34:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:24,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:24,276 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:24,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 478 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5949 [2021-06-05 04:34:24,476 INFO L430 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1819190630, now seen corresponding path program 332 times [2021-06-05 04:34:24,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:24,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317864349] [2021-06-05 04:34:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:24,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:24,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317864349] [2021-06-05 04:34:24,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317864349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:24,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116347925] [2021-06-05 04:34:24,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:24,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:24,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:24,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:24,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:24,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:24,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:24,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:24,727 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:24,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:24,748 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:24,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:24,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:24,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:24,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:24,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:24,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:24,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:24,794 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:24,824 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:24,824 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:24,825 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:24,825 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:24,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116347925] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:24,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:24,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:24,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942921091] [2021-06-05 04:34:24,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:24,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:24,883 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:25,350 INFO L93 Difference]: Finished difference Result 1121 states and 4317 transitions. [2021-06-05 04:34:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:25,353 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 04:34:25,353 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 04:34:25,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 422.4ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 04:34:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1019. [2021-06-05 04:34:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9292730844793713) internal successors, (4000), 1018 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4000 transitions. [2021-06-05 04:34:25,364 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4000 transitions. Word has length 19 [2021-06-05 04:34:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:25,364 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4000 transitions. [2021-06-05 04:34:25,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4000 transitions. [2021-06-05 04:34:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:25,365 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:25,365 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:25,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5956,479 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:25,566 INFO L430 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:25,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1549753222, now seen corresponding path program 333 times [2021-06-05 04:34:25,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:25,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687355267] [2021-06-05 04:34:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:25,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:25,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687355267] [2021-06-05 04:34:25,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687355267] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:25,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617437028] [2021-06-05 04:34:25,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:25,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:34:25,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:25,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:25,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:25,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:25,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:25,726 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:25,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:25,741 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:25,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:25,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:25,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:25,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:25,790 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:25,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:25,793 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:25,795 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:25,826 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:25,826 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:25,826 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:25,826 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:25,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617437028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:25,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:25,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:25,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228876421] [2021-06-05 04:34:25,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:25,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:25,869 INFO L87 Difference]: Start difference. First operand 1019 states and 4000 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:26,223 INFO L93 Difference]: Finished difference Result 1109 states and 4293 transitions. [2021-06-05 04:34:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:26,225 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 04:34:26,225 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 04:34:26,226 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 301.4ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:34:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 04:34:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1012. [2021-06-05 04:34:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 04:34:26,236 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 04:34:26,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:26,236 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 04:34:26,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:26,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 04:34:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:26,237 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:26,237 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:26,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5963,480 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:26,438 INFO L430 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 90143296, now seen corresponding path program 334 times [2021-06-05 04:34:26,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:26,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618409863] [2021-06-05 04:34:26,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:26,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:26,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618409863] [2021-06-05 04:34:26,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618409863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:26,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505020338] [2021-06-05 04:34:26,535 INFO L93 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 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:26,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:26,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:26,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:26,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:26,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:26,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:26,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:26,644 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:26,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:26,658 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:26,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:26,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:26,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:26,724 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:26,726 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:26,728 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:26,744 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 04:34:26,744 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:26,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:26,744 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:26,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505020338] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:26,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:26,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:26,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336386892] [2021-06-05 04:34:26,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:26,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:26,766 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:27,094 INFO L93 Difference]: Finished difference Result 1094 states and 4245 transitions. [2021-06-05 04:34:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:27,096 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 04:34:27,096 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 04:34:27,096 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 338.3ms TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 04:34:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1012. [2021-06-05 04:34:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 04:34:27,107 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 04:34:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:27,107 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 04:34:27,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 04:34:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:27,109 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:27,109 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:27,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5968,481 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:27,309 INFO L430 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:27,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1871473394, now seen corresponding path program 335 times [2021-06-05 04:34:27,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:27,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481905514] [2021-06-05 04:34:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:27,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:27,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481905514] [2021-06-05 04:34:27,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481905514] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:27,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138819067] [2021-06-05 04:34:27,386 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:27,413 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:34:27,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:27,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:27,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:27,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:27,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:27,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:27,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:27,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:27,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:27,499 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:27,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:27,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:27,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:27,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:27,546 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:27,560 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:27,560 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:27,560 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:27,560 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:27,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138819067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:27,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:27,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:27,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176951388] [2021-06-05 04:34:27,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:27,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:27,578 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:27,792 INFO L93 Difference]: Finished difference Result 1100 states and 4269 transitions. [2021-06-05 04:34:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:27,794 INFO L225 Difference]: With dead ends: 1100 [2021-06-05 04:34:27,794 INFO L226 Difference]: Without dead ends: 1100 [2021-06-05 04:34:27,794 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 208.8ms TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-06-05 04:34:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1006. [2021-06-05 04:34:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.9323383084577115) internal successors, (3952), 1005 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3952 transitions. [2021-06-05 04:34:27,804 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3952 transitions. Word has length 19 [2021-06-05 04:34:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:27,804 INFO L482 AbstractCegarLoop]: Abstraction has 1006 states and 3952 transitions. [2021-06-05 04:34:27,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3952 transitions. [2021-06-05 04:34:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:27,806 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:27,806 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:28,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5975,482 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:28,006 INFO L430 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:28,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1340030452, now seen corresponding path program 336 times [2021-06-05 04:34:28,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:28,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99985617] [2021-06-05 04:34:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:28,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:28,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99985617] [2021-06-05 04:34:28,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99985617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:28,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526371308] [2021-06-05 04:34:28,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:28,146 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:34:28,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:28,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:28,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:28,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:28,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:28,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:28,228 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:28,228 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:28,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:28,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:28,289 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:28,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:28,292 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:28,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:28,295 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:28,297 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:28,327 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:28,327 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:28,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:28,327 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:28,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526371308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:28,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:28,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:28,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465897978] [2021-06-05 04:34:28,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:28,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:28,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:28,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:28,377 INFO L87 Difference]: Start difference. First operand 1006 states and 3952 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:28,995 INFO L93 Difference]: Finished difference Result 1214 states and 4633 transitions. [2021-06-05 04:34:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:28,997 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 04:34:28,997 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 04:34:28,997 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 521.2ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 04:34:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1015. [2021-06-05 04:34:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9358974358974357) internal successors, (3991), 1014 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3991 transitions. [2021-06-05 04:34:29,009 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3991 transitions. Word has length 19 [2021-06-05 04:34:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:29,009 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3991 transitions. [2021-06-05 04:34:29,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3991 transitions. [2021-06-05 04:34:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:29,010 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:29,010 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:29,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5978,483 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:29,210 INFO L430 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -144994278, now seen corresponding path program 337 times [2021-06-05 04:34:29,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:29,211 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287573982] [2021-06-05 04:34:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:29,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:29,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287573982] [2021-06-05 04:34:29,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287573982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:29,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165850648] [2021-06-05 04:34:29,282 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:29,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:29,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:29,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:29,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:29,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:29,356 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:29,368 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:29,368 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:29,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:29,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:29,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:29,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:29,425 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:29,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:29,428 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:29,431 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:29,461 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:29,461 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:29,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:29,462 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:29,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165850648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:29,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:29,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:29,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118230493] [2021-06-05 04:34:29,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:29,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:29,515 INFO L87 Difference]: Start difference. First operand 1015 states and 3991 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:30,009 INFO L93 Difference]: Finished difference Result 1219 states and 4648 transitions. [2021-06-05 04:34:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 04:34:30,009 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:30,011 INFO L225 Difference]: With dead ends: 1219 [2021-06-05 04:34:30,011 INFO L226 Difference]: Without dead ends: 1215 [2021-06-05 04:34:30,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 434.7ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-06-05 04:34:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1019. [2021-06-05 04:34:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9351669941060905) internal successors, (4006), 1018 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4006 transitions. [2021-06-05 04:34:30,023 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4006 transitions. Word has length 19 [2021-06-05 04:34:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:30,023 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4006 transitions. [2021-06-05 04:34:30,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4006 transitions. [2021-06-05 04:34:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:30,024 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:30,024 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:30,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5983,484 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:30,225 INFO L430 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1283960828, now seen corresponding path program 338 times [2021-06-05 04:34:30,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:30,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246266081] [2021-06-05 04:34:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:30,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:30,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246266081] [2021-06-05 04:34:30,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246266081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:30,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545727577] [2021-06-05 04:34:30,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:30,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:30,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:30,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:30,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:30,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:30,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:30,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:30,428 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:30,440 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:30,440 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:30,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:30,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:30,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:30,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:30,502 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:30,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:30,506 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:30,508 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:30,538 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:30,538 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:30,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:30,539 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:30,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545727577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:30,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:30,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:30,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461293527] [2021-06-05 04:34:30,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:30,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:30,607 INFO L87 Difference]: Start difference. First operand 1019 states and 4006 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:31,256 INFO L93 Difference]: Finished difference Result 1217 states and 4643 transitions. [2021-06-05 04:34:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:31,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:31,258 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 04:34:31,258 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 04:34:31,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 564.9ms TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 04:34:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1019. [2021-06-05 04:34:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 04:34:31,270 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 04:34:31,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:31,270 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 04:34:31,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 04:34:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:31,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:31,271 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:31,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5990,485 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:31,472 INFO L430 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:31,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2084983024, now seen corresponding path program 339 times [2021-06-05 04:34:31,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:31,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757113605] [2021-06-05 04:34:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:31,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:31,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757113605] [2021-06-05 04:34:31,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757113605] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:31,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814324447] [2021-06-05 04:34:31,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:31,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:34:31,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:31,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:31,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:31,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:31,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:31,621 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:31,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:31,633 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:31,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:31,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:31,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:31,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:31,691 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:31,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:31,694 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:31,696 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:31,727 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:31,727 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:31,728 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:31,728 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:31,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814324447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:31,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:31,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:31,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524146695] [2021-06-05 04:34:31,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:31,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:31,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:31,770 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:32,255 INFO L93 Difference]: Finished difference Result 1204 states and 4617 transitions. [2021-06-05 04:34:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:32,257 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 04:34:32,257 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 04:34:32,257 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 402.5ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:34:32,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 04:34:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 04:34:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9327398615232445) internal successors, (3976), 1011 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3976 transitions. [2021-06-05 04:34:32,268 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3976 transitions. Word has length 19 [2021-06-05 04:34:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:32,268 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3976 transitions. [2021-06-05 04:34:32,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3976 transitions. [2021-06-05 04:34:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:32,269 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:32,270 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:32,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5997,486 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:32,470 INFO L430 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -445086506, now seen corresponding path program 340 times [2021-06-05 04:34:32,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:32,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48914163] [2021-06-05 04:34:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:32,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:32,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48914163] [2021-06-05 04:34:32,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48914163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:32,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329037982] [2021-06-05 04:34:32,569 INFO L93 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 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:32,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:32,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:32,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:32,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:32,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:32,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:32,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:32,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:32,674 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:32,674 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:32,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:32,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:32,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:32,752 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:32,754 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:32,756 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:32,771 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 04:34:32,772 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:32,772 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:32,772 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:32,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329037982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:32,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:32,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:32,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217758198] [2021-06-05 04:34:32,794 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:32,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:32,794 INFO L87 Difference]: Start difference. First operand 1012 states and 3976 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:33,307 INFO L93 Difference]: Finished difference Result 1193 states and 4577 transitions. [2021-06-05 04:34:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:33,309 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 04:34:33,309 INFO L226 Difference]: Without dead ends: 1187 [2021-06-05 04:34:33,309 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 434.7ms TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:34:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-06-05 04:34:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2021-06-05 04:34:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 04:34:33,321 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 04:34:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:33,321 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 04:34:33,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 04:34:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:33,322 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:33,322 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:33,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6002,487 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:33,523 INFO L430 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1336243592, now seen corresponding path program 341 times [2021-06-05 04:34:33,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:33,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268218783] [2021-06-05 04:34:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:33,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:33,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268218783] [2021-06-05 04:34:33,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268218783] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:33,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89915087] [2021-06-05 04:34:33,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:33,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:34:33,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:33,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 04:34:33,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:33,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:33,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:33,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:33,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:33,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:33,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:33,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:33,683 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:33,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:33,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:33,748 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:33,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:33,751 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:33,764 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:33,764 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:33,765 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:33,765 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:33,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89915087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:33,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:33,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 04:34:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738902649] [2021-06-05 04:34:33,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 04:34:33,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 04:34:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 04:34:33,783 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:34,126 INFO L93 Difference]: Finished difference Result 1186 states and 4563 transitions. [2021-06-05 04:34:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:34,128 INFO L225 Difference]: With dead ends: 1186 [2021-06-05 04:34:34,128 INFO L226 Difference]: Without dead ends: 1186 [2021-06-05 04:34:34,128 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 247.7ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-06-05 04:34:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1009. [2021-06-05 04:34:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.9325396825396823) internal successors, (3964), 1008 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3964 transitions. [2021-06-05 04:34:34,139 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3964 transitions. Word has length 19 [2021-06-05 04:34:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:34,139 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3964 transitions. [2021-06-05 04:34:34,139 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3964 transitions. [2021-06-05 04:34:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:34,140 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:34,141 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:34,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6008,488 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:34,341 INFO L430 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1761243810, now seen corresponding path program 342 times [2021-06-05 04:34:34,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:34,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298160695] [2021-06-05 04:34:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:34,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:34,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298160695] [2021-06-05 04:34:34,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298160695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:34,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301961415] [2021-06-05 04:34:34,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:34,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:34,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:34,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:34,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:34,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:34,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:34,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:34,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:34,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:34,538 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:34,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:34,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:34,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:34,604 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:34,606 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:34,608 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:34,624 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 04:34:34,624 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:34,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:34,624 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:34,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301961415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:34,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:34,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:34,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92364152] [2021-06-05 04:34:34,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:34,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:34,646 INFO L87 Difference]: Start difference. First operand 1009 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:35,053 INFO L93 Difference]: Finished difference Result 1174 states and 4521 transitions. [2021-06-05 04:34:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:35,053 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:35,055 INFO L225 Difference]: With dead ends: 1174 [2021-06-05 04:34:35,055 INFO L226 Difference]: Without dead ends: 1165 [2021-06-05 04:34:35,055 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 397.8ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-06-05 04:34:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1009. [2021-06-05 04:34:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 04:34:35,067 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 04:34:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:35,067 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 04:34:35,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 04:34:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:35,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:35,068 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:35,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6011,489 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:35,268 INFO L430 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 764788786, now seen corresponding path program 343 times [2021-06-05 04:34:35,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:35,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073141307] [2021-06-05 04:34:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:35,331 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:35,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073141307] [2021-06-05 04:34:35,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073141307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:35,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250457239] [2021-06-05 04:34:35,331 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:35,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:35,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:35,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:35,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:35,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:35,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:35,406 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:35,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:35,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:35,418 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:35,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:35,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:35,464 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:35,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:35,466 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:35,490 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:35,490 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:35,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:35,490 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:35,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250457239] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:35,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:35,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 04:34:35,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450581682] [2021-06-05 04:34:35,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 04:34:35,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 04:34:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 04:34:35,508 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:35,778 INFO L93 Difference]: Finished difference Result 1241 states and 4758 transitions. [2021-06-05 04:34:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:35,780 INFO L225 Difference]: With dead ends: 1241 [2021-06-05 04:34:35,780 INFO L226 Difference]: Without dead ends: 1241 [2021-06-05 04:34:35,780 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 191.5ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-06-05 04:34:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1012. [2021-06-05 04:34:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 04:34:35,792 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 04:34:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:35,792 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 04:34:35,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 04:34:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:35,794 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:35,794 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:35,994 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6017,490 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:35,994 INFO L430 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -136082742, now seen corresponding path program 344 times [2021-06-05 04:34:35,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:35,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7299152] [2021-06-05 04:34:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:36,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:36,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7299152] [2021-06-05 04:34:36,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7299152] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:36,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14317603] [2021-06-05 04:34:36,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:36,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:36,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:36,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:36,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:36,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:36,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:36,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:36,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:36,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:36,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:36,228 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:36,228 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:36,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:36,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:36,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:36,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:36,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:36,308 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:36,308 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:36,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:36,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:36,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14317603] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:36,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:36,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:36,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038288169] [2021-06-05 04:34:36,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:36,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:36,328 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:36,706 INFO L93 Difference]: Finished difference Result 1290 states and 4947 transitions. [2021-06-05 04:34:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:36,709 INFO L225 Difference]: With dead ends: 1290 [2021-06-05 04:34:36,709 INFO L226 Difference]: Without dead ends: 1290 [2021-06-05 04:34:36,709 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 315.8ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 04:34:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-06-05 04:34:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1017. [2021-06-05 04:34:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 3.925196850393701) internal successors, (3988), 1016 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 3988 transitions. [2021-06-05 04:34:36,722 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 3988 transitions. Word has length 19 [2021-06-05 04:34:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:36,722 INFO L482 AbstractCegarLoop]: Abstraction has 1017 states and 3988 transitions. [2021-06-05 04:34:36,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 3988 transitions. [2021-06-05 04:34:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:36,723 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:36,723 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:36,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6020,491 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:36,924 INFO L430 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2085149096, now seen corresponding path program 345 times [2021-06-05 04:34:36,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:36,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912281003] [2021-06-05 04:34:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:37,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:37,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912281003] [2021-06-05 04:34:37,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912281003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:37,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010317634] [2021-06-05 04:34:37,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:37,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:34:37,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:37,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:37,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:37,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:37,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:37,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:37,141 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:37,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:37,163 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:37,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:37,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:37,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:37,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,257 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:37,258 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:37,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,258 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:37,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010317634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:37,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:37,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:37,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145469242] [2021-06-05 04:34:37,277 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:37,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:37,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:37,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:37,278 INFO L87 Difference]: Start difference. First operand 1017 states and 3988 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:37,600 INFO L93 Difference]: Finished difference Result 1213 states and 4672 transitions. [2021-06-05 04:34:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:37,602 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 04:34:37,602 INFO L226 Difference]: Without dead ends: 1213 [2021-06-05 04:34:37,602 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 303.1ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:34:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-06-05 04:34:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1020. [2021-06-05 04:34:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9254170755642788) internal successors, (4000), 1019 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4000 transitions. [2021-06-05 04:34:37,613 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4000 transitions. Word has length 19 [2021-06-05 04:34:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:37,614 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4000 transitions. [2021-06-05 04:34:37,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4000 transitions. [2021-06-05 04:34:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:37,615 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:37,615 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:37,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 492 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6023 [2021-06-05 04:34:37,815 INFO L430 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash 601233930, now seen corresponding path program 346 times [2021-06-05 04:34:37,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:37,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60547594] [2021-06-05 04:34:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:37,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:37,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60547594] [2021-06-05 04:34:37,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60547594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:37,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639869921] [2021-06-05 04:34:37,902 INFO L93 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 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:37,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:37,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:37,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:37,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:37,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:37,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:37,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:37,994 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:38,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:38,007 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 04:34:38,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:38,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:38,083 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,084 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:38,085 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:38,087 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:38,089 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,103 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:38,103 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:38,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:38,104 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:38,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639869921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:38,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:38,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:38,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481578655] [2021-06-05 04:34:38,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:38,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:38,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:38,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:38,124 INFO L87 Difference]: Start difference. First operand 1020 states and 4000 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:38,375 INFO L93 Difference]: Finished difference Result 1203 states and 4636 transitions. [2021-06-05 04:34:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:38,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:38,377 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 04:34:38,377 INFO L226 Difference]: Without dead ends: 1195 [2021-06-05 04:34:38,377 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 238.3ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-06-05 04:34:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1020. [2021-06-05 04:34:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9224730127576053) internal successors, (3997), 1019 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3997 transitions. [2021-06-05 04:34:38,390 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 3997 transitions. Word has length 19 [2021-06-05 04:34:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:38,390 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 3997 transitions. [2021-06-05 04:34:38,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 3997 transitions. [2021-06-05 04:34:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:38,391 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:38,391 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:38,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 493 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6026 [2021-06-05 04:34:38,591 INFO L430 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash -603911226, now seen corresponding path program 347 times [2021-06-05 04:34:38,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:38,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509047026] [2021-06-05 04:34:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:38,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:38,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509047026] [2021-06-05 04:34:38,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509047026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:38,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430217933] [2021-06-05 04:34:38,717 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:38,744 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:38,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:38,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:38,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:38,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:38,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:38,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:38,832 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:38,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:38,858 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:38,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:38,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:38,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:38,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:38,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:38,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:38,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:38,928 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:38,958 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:38,958 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:38,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:38,959 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:39,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430217933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:39,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:39,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:39,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120106415] [2021-06-05 04:34:39,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:39,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:39,008 INFO L87 Difference]: Start difference. First operand 1020 states and 3997 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:39,658 INFO L93 Difference]: Finished difference Result 1246 states and 4755 transitions. [2021-06-05 04:34:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:39,660 INFO L225 Difference]: With dead ends: 1246 [2021-06-05 04:34:39,660 INFO L226 Difference]: Without dead ends: 1246 [2021-06-05 04:34:39,660 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 526.8ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-06-05 04:34:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1023. [2021-06-05 04:34:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.9256360078277885) internal successors, (4012), 1022 states have internal predecessors, (4012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4012 transitions. [2021-06-05 04:34:39,673 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4012 transitions. Word has length 19 [2021-06-05 04:34:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:39,673 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4012 transitions. [2021-06-05 04:34:39,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4012 transitions. [2021-06-05 04:34:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:39,674 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:39,674 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:39,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 494 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6032 [2021-06-05 04:34:39,875 INFO L430 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash 591124948, now seen corresponding path program 348 times [2021-06-05 04:34:39,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:39,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038101540] [2021-06-05 04:34:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:39,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:39,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038101540] [2021-06-05 04:34:39,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038101540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:39,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558713316] [2021-06-05 04:34:39,972 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:39,998 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:39,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:39,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:39,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:40,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:40,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:40,064 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:40,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:40,077 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 04:34:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:40,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:40,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:40,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:40,146 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:40,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:40,149 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:40,151 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:40,183 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:40,184 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:40,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:40,184 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:40,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558713316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:40,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:40,242 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:40,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23828132] [2021-06-05 04:34:40,242 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:40,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:40,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:40,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:40,242 INFO L87 Difference]: Start difference. First operand 1023 states and 4012 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:40,677 INFO L93 Difference]: Finished difference Result 1222 states and 4685 transitions. [2021-06-05 04:34:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:40,679 INFO L225 Difference]: With dead ends: 1222 [2021-06-05 04:34:40,679 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 04:34:40,680 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 448.1ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:34:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 04:34:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1027. [2021-06-05 04:34:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9249512670565303) internal successors, (4027), 1026 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4027 transitions. [2021-06-05 04:34:40,692 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4027 transitions. Word has length 19 [2021-06-05 04:34:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:40,692 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4027 transitions. [2021-06-05 04:34:40,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4027 transitions. [2021-06-05 04:34:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:40,693 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:40,693 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:40,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 495 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6037 [2021-06-05 04:34:40,894 INFO L430 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2020080054, now seen corresponding path program 349 times [2021-06-05 04:34:40,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:40,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575692989] [2021-06-05 04:34:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:41,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:41,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575692989] [2021-06-05 04:34:41,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575692989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:41,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48004784] [2021-06-05 04:34:41,016 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:41,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:41,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:41,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:41,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:41,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:41,118 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:41,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:41,130 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:41,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:41,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:41,190 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:41,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:41,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:41,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:41,196 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:41,198 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:41,228 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:41,229 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:41,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:41,229 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:41,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48004784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:41,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:41,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:41,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232711561] [2021-06-05 04:34:41,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:41,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:41,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:41,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:41,288 INFO L87 Difference]: Start difference. First operand 1027 states and 4027 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:41,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:41,820 INFO L93 Difference]: Finished difference Result 1229 states and 4723 transitions. [2021-06-05 04:34:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 04:34:41,821 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:41,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:41,823 INFO L225 Difference]: With dead ends: 1229 [2021-06-05 04:34:41,823 INFO L226 Difference]: Without dead ends: 1226 [2021-06-05 04:34:41,823 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 528.7ms TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:34:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-06-05 04:34:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1027. [2021-06-05 04:34:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.922027290448343) internal successors, (4024), 1026 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4024 transitions. [2021-06-05 04:34:41,835 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4024 transitions. Word has length 19 [2021-06-05 04:34:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:41,835 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4024 transitions. [2021-06-05 04:34:41,835 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4024 transitions. [2021-06-05 04:34:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:41,836 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:41,836 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:42,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6044,496 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:42,037 INFO L430 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:42,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1348863798, now seen corresponding path program 350 times [2021-06-05 04:34:42,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:42,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085457721] [2021-06-05 04:34:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:42,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:42,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085457721] [2021-06-05 04:34:42,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085457721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:42,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649698991] [2021-06-05 04:34:42,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:42,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:42,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:42,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:42,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:42,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:42,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:42,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:42,237 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:42,249 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:42,249 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 04:34:42,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:42,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:42,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:42,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:42,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:42,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:42,313 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:42,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:42,345 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:42,345 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:42,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:42,346 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:42,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649698991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:42,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:42,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:42,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587438250] [2021-06-05 04:34:42,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:42,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:42,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:42,391 INFO L87 Difference]: Start difference. First operand 1027 states and 4024 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:42,640 INFO L93 Difference]: Finished difference Result 1204 states and 4648 transitions. [2021-06-05 04:34:42,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:42,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:42,642 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 04:34:42,642 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 04:34:42,642 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 306.1ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 04:34:42,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 04:34:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 04:34:42,654 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 04:34:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:42,654 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 04:34:42,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 04:34:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:42,656 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:42,656 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:42,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 497 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6051 [2021-06-05 04:34:42,856 INFO L430 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1136732820, now seen corresponding path program 351 times [2021-06-05 04:34:42,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:42,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89210752] [2021-06-05 04:34:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:42,970 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:42,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89210752] [2021-06-05 04:34:42,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89210752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:42,970 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929761477] [2021-06-05 04:34:42,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:42,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:34:42,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:42,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:42,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:43,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:43,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:43,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:43,091 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:43,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:43,107 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:43,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:43,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:43,163 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,177 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:43,177 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:43,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,178 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:43,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929761477] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:43,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:43,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:43,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154924523] [2021-06-05 04:34:43,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:43,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:43,198 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:43,562 INFO L93 Difference]: Finished difference Result 1117 states and 4331 transitions. [2021-06-05 04:34:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:43,562 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:43,564 INFO L225 Difference]: With dead ends: 1117 [2021-06-05 04:34:43,564 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 04:34:43,564 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 298.6ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 04:34:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 04:34:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1018. [2021-06-05 04:34:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 04:34:43,586 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 04:34:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:43,586 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 04:34:43,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 04:34:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:43,587 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:43,587 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:43,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 498 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6056 [2021-06-05 04:34:43,788 INFO L430 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash -471851450, now seen corresponding path program 352 times [2021-06-05 04:34:43,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:43,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603726472] [2021-06-05 04:34:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:43,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:43,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603726472] [2021-06-05 04:34:43,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603726472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:43,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760932299] [2021-06-05 04:34:43,872 INFO L93 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 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:43,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:43,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:43,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:43,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:43,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:43,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:43,975 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:43,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:43,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:43,993 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:43,993 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:44,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:44,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:44,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,057 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:34:44,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:44,060 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:44,062 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,076 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 04:34:44,076 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:44,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:44,076 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:44,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760932299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:44,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:44,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:44,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283569889] [2021-06-05 04:34:44,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:44,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:44,096 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:44,359 INFO L93 Difference]: Finished difference Result 1107 states and 4295 transitions. [2021-06-05 04:34:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:44,361 INFO L225 Difference]: With dead ends: 1107 [2021-06-05 04:34:44,361 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 04:34:44,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 233.7ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:34:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 04:34:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1018. [2021-06-05 04:34:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 04:34:44,373 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 04:34:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:44,373 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 04:34:44,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 04:34:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:44,374 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:44,374 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:44,574 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 499 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6059 [2021-06-05 04:34:44,575 INFO L430 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1676996606, now seen corresponding path program 353 times [2021-06-05 04:34:44,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:44,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703026575] [2021-06-05 04:34:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:44,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:44,699 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703026575] [2021-06-05 04:34:44,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703026575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:44,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190271889] [2021-06-05 04:34:44,700 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:44,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:44,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:44,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:44,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:44,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:44,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:44,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:44,837 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:44,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:44,853 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:44,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:44,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:44,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:44,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:44,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:44,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:44,910 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:44,913 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:44,949 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:44,950 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:44,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:44,950 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:45,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190271889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:45,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:45,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:45,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260901168] [2021-06-05 04:34:45,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:45,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:45,017 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:45,513 INFO L93 Difference]: Finished difference Result 1133 states and 4365 transitions. [2021-06-05 04:34:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:45,513 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:45,515 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 04:34:45,515 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 04:34:45,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 473.3ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 04:34:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 04:34:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9274509803921567) internal successors, (4006), 1020 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4006 transitions. [2021-06-05 04:34:45,526 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4006 transitions. Word has length 19 [2021-06-05 04:34:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:45,526 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4006 transitions. [2021-06-05 04:34:45,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4006 transitions. [2021-06-05 04:34:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:45,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:45,528 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:45,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 500 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6066 [2021-06-05 04:34:45,728 INFO L430 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash -481960432, now seen corresponding path program 354 times [2021-06-05 04:34:45,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:45,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226936553] [2021-06-05 04:34:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:45,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:45,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226936553] [2021-06-05 04:34:45,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226936553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:45,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806703089] [2021-06-05 04:34:45,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:45,837 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:34:45,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:45,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:45,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:45,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:45,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:45,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:45,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:45,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:45,933 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:45,933 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 04:34:45,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:45,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:45,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:45,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:45,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:45,972 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:45,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:45,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:45,975 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:45,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:45,978 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,010 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:46,010 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:46,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:46,011 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:46,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806703089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:46,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:46,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:46,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004821245] [2021-06-05 04:34:46,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:46,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:46,068 INFO L87 Difference]: Start difference. First operand 1021 states and 4006 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:46,409 INFO L93 Difference]: Finished difference Result 1126 states and 4344 transitions. [2021-06-05 04:34:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:46,411 INFO L225 Difference]: With dead ends: 1126 [2021-06-05 04:34:46,412 INFO L226 Difference]: Without dead ends: 1122 [2021-06-05 04:34:46,412 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 300.8ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2021-06-05 04:34:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1025. [2021-06-05 04:34:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 04:34:46,423 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 04:34:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:46,423 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 04:34:46,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 04:34:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:46,424 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:46,424 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:46,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6071,501 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:46,625 INFO L430 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 946994674, now seen corresponding path program 355 times [2021-06-05 04:34:46,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:46,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143190061] [2021-06-05 04:34:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:46,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:46,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143190061] [2021-06-05 04:34:46,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143190061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:46,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461843320] [2021-06-05 04:34:46,748 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:46,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:46,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:46,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:46,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:46,864 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:46,866 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:46,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:46,881 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:46,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:46,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:46,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:46,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:46,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:46,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:46,926 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:46,928 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:46,959 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:46,959 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:46,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:46,959 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:47,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461843320] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:47,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:47,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:47,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043226919] [2021-06-05 04:34:47,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:47,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:47,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:47,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:47,029 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:47,473 INFO L93 Difference]: Finished difference Result 1123 states and 4353 transitions. [2021-06-05 04:34:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:47,476 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 04:34:47,476 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 04:34:47,476 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 434.5ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 04:34:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1025. [2021-06-05 04:34:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.923828125) internal successors, (4018), 1024 states have internal predecessors, (4018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4018 transitions. [2021-06-05 04:34:47,487 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4018 transitions. Word has length 19 [2021-06-05 04:34:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:47,487 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4018 transitions. [2021-06-05 04:34:47,487 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4018 transitions. [2021-06-05 04:34:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:47,488 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:47,488 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:47,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 502 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6078 [2021-06-05 04:34:47,689 INFO L430 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:47,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1873018118, now seen corresponding path program 356 times [2021-06-05 04:34:47,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:47,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327753602] [2021-06-05 04:34:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:47,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:47,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327753602] [2021-06-05 04:34:47,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327753602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:47,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683145569] [2021-06-05 04:34:47,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:47,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:47,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:47,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:47,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:47,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:47,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:47,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:47,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:47,896 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 04:34:47,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:47,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:47,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:47,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:47,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:47,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:47,939 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:47,941 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:47,973 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:47,973 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:47,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:47,974 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:48,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683145569] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:48,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:48,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:48,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715309244] [2021-06-05 04:34:48,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:48,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:48,019 INFO L87 Difference]: Start difference. First operand 1025 states and 4018 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:48,228 INFO L93 Difference]: Finished difference Result 1108 states and 4307 transitions. [2021-06-05 04:34:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:48,230 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 04:34:48,230 INFO L226 Difference]: Without dead ends: 1108 [2021-06-05 04:34:48,230 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 218.4ms TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:34:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-06-05 04:34:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1015. [2021-06-05 04:34:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9270216962524653) internal successors, (3982), 1014 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3982 transitions. [2021-06-05 04:34:48,241 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3982 transitions. Word has length 19 [2021-06-05 04:34:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:48,241 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3982 transitions. [2021-06-05 04:34:48,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3982 transitions. [2021-06-05 04:34:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:48,242 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:48,242 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:48,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 503 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6085 [2021-06-05 04:34:48,443 INFO L430 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:48,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1301813386, now seen corresponding path program 357 times [2021-06-05 04:34:48,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:48,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899849890] [2021-06-05 04:34:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:48,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:48,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899849890] [2021-06-05 04:34:48,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899849890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:48,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319341921] [2021-06-05 04:34:48,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:48,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:34:48,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:48,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:48,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:48,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:48,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:48,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:48,708 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:48,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:48,723 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:48,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:48,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:48,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:48,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:48,764 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:48,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:48,766 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:48,769 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:48,799 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:48,799 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:48,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:48,800 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:48,849 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319341921] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:48,849 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:48,849 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:48,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302316855] [2021-06-05 04:34:48,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:48,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:48,849 INFO L87 Difference]: Start difference. First operand 1015 states and 3982 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:49,349 INFO L93 Difference]: Finished difference Result 1139 states and 4383 transitions. [2021-06-05 04:34:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:49,351 INFO L225 Difference]: With dead ends: 1139 [2021-06-05 04:34:49,351 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 04:34:49,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 455.0ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 04:34:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1021. [2021-06-05 04:34:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.930392156862745) internal successors, (4009), 1020 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4009 transitions. [2021-06-05 04:34:49,362 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4009 transitions. Word has length 19 [2021-06-05 04:34:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:49,362 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4009 transitions. [2021-06-05 04:34:49,362 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4009 transitions. [2021-06-05 04:34:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:49,364 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:49,364 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:49,564 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6090,504 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:49,564 INFO L430 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1798117736, now seen corresponding path program 358 times [2021-06-05 04:34:49,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:49,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394353763] [2021-06-05 04:34:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:49,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:49,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394353763] [2021-06-05 04:34:49,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394353763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:49,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813988353] [2021-06-05 04:34:49,643 INFO L93 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 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:49,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:49,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:49,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:49,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:49,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:49,745 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:49,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:49,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:49,763 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:49,797 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:34:49,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:49,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:49,807 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:49,810 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:49,813 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:49,845 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:49,845 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:49,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:49,845 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:49,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813988353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:49,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:49,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:49,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988396039] [2021-06-05 04:34:49,901 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:49,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:49,901 INFO L87 Difference]: Start difference. First operand 1021 states and 4009 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:50,233 INFO L93 Difference]: Finished difference Result 1129 states and 4353 transitions. [2021-06-05 04:34:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:34:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:50,235 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 04:34:50,235 INFO L226 Difference]: Without dead ends: 1125 [2021-06-05 04:34:50,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 284.9ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-06-05 04:34:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1025. [2021-06-05 04:34:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9296875) internal successors, (4024), 1024 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4024 transitions. [2021-06-05 04:34:50,246 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4024 transitions. Word has length 19 [2021-06-05 04:34:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:50,246 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4024 transitions. [2021-06-05 04:34:50,246 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4024 transitions. [2021-06-05 04:34:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:50,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:50,248 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:50,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 505 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6095 [2021-06-05 04:34:50,461 INFO L430 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash -369162630, now seen corresponding path program 359 times [2021-06-05 04:34:50,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:50,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323300783] [2021-06-05 04:34:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:50,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:50,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323300783] [2021-06-05 04:34:50,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323300783] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:50,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507384402] [2021-06-05 04:34:50,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:50,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:50,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:50,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:50,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:50,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:50,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:50,698 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:50,700 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:50,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:50,715 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:50,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:50,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:50,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:50,770 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:50,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:50,774 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:50,778 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:50,814 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:50,815 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:50,815 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:50,815 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:50,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507384402] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:50,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:50,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:50,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238441822] [2021-06-05 04:34:50,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:50,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:50,873 INFO L87 Difference]: Start difference. First operand 1025 states and 4024 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:51,377 INFO L93 Difference]: Finished difference Result 1142 states and 4393 transitions. [2021-06-05 04:34:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:51,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:51,379 INFO L225 Difference]: With dead ends: 1142 [2021-06-05 04:34:51,379 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 04:34:51,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 453.9ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:34:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 04:34:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1025. [2021-06-05 04:34:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 04:34:51,390 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 04:34:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:51,390 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 04:34:51,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 04:34:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:51,392 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:51,392 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:51,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 506 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6102 [2021-06-05 04:34:51,592 INFO L430 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:51,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash 556860814, now seen corresponding path program 360 times [2021-06-05 04:34:51,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:51,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838807202] [2021-06-05 04:34:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:51,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:51,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838807202] [2021-06-05 04:34:51,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838807202] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:51,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229953741] [2021-06-05 04:34:51,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:51,699 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:34:51,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:51,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:51,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:51,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:51,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:51,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:51,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:51,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:51,794 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:51,829 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:34:51,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:51,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:51,834 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:51,837 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:51,839 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:51,871 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 04:34:51,871 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:51,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:51,872 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 04:34:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:51,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229953741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:51,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:51,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:51,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313057460] [2021-06-05 04:34:51,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:51,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:51,930 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:52,191 INFO L93 Difference]: Finished difference Result 1114 states and 4322 transitions. [2021-06-05 04:34:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:52,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:52,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:52,193 INFO L225 Difference]: With dead ends: 1114 [2021-06-05 04:34:52,193 INFO L226 Difference]: Without dead ends: 1114 [2021-06-05 04:34:52,193 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 257.6ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-06-05 04:34:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1018. [2021-06-05 04:34:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 04:34:52,204 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 04:34:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:52,204 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 04:34:52,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 04:34:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:52,205 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:52,205 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:52,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6109,507 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:52,406 INFO L430 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2098209964, now seen corresponding path program 361 times [2021-06-05 04:34:52,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:52,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561392582] [2021-06-05 04:34:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:52,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:52,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561392582] [2021-06-05 04:34:52,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561392582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:52,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063909627] [2021-06-05 04:34:52,516 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:52,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:52,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:52,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:52,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:52,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:52,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:52,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:52,647 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 04:34:52,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:52,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:52,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:52,712 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:52,714 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:52,717 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:52,732 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 04:34:52,732 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:52,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:52,732 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 04:34:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:52,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063909627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:52,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:52,754 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:52,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683317981] [2021-06-05 04:34:52,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:52,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:52,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:52,754 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:53,171 INFO L93 Difference]: Finished difference Result 1108 states and 4301 transitions. [2021-06-05 04:34:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:53,173 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 04:34:53,173 INFO L226 Difference]: Without dead ends: 1102 [2021-06-05 04:34:53,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 399.3ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-06-05 04:34:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1018. [2021-06-05 04:34:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 04:34:53,184 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 04:34:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:53,184 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 04:34:53,184 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 04:34:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:53,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:53,185 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:53,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6114,508 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:53,386 INFO L430 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash -316879866, now seen corresponding path program 362 times [2021-06-05 04:34:53,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:53,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130918705] [2021-06-05 04:34:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:53,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:53,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130918705] [2021-06-05 04:34:53,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130918705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:53,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538664123] [2021-06-05 04:34:53,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:53,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:53,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:53,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:53,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:53,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:53,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 04:34:53,586 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:53,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:53,588 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:53,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:34:53,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:53,604 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 04:34:53,650 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 04:34:53,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:53,653 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:53,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:53,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:53,669 INFO L628 ElimStorePlain]: treesize reduction 29, result has 32.6 percent of original size [2021-06-05 04:34:53,669 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:53,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:53,670 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:14 [2021-06-05 04:34:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:53,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538664123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:53,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:53,689 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 04:34:53,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532852299] [2021-06-05 04:34:53,689 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 04:34:53,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:53,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 04:34:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 04:34:53,690 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:53,984 INFO L93 Difference]: Finished difference Result 1111 states and 4316 transitions. [2021-06-05 04:34:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:53,986 INFO L225 Difference]: With dead ends: 1111 [2021-06-05 04:34:53,986 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 04:34:53,986 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 232.9ms TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 04:34:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 04:34:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1007. [2021-06-05 04:34:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9343936381709743) internal successors, (3958), 1006 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3958 transitions. [2021-06-05 04:34:53,997 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3958 transitions. Word has length 19 [2021-06-05 04:34:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:53,997 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3958 transitions. [2021-06-05 04:34:53,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3958 transitions. [2021-06-05 04:34:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:53,998 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:53,998 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:54,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 509 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6121 [2021-06-05 04:34:54,199 INFO L430 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash 927027954, now seen corresponding path program 363 times [2021-06-05 04:34:54,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:54,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934470840] [2021-06-05 04:34:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:54,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:54,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934470840] [2021-06-05 04:34:54,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934470840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:54,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001844912] [2021-06-05 04:34:54,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:54,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:34:54,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:54,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:54,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:54,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:54,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:54,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,413 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:54,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:54,414 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:54,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:54,416 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:54,419 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,461 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:34:54,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:34:54,462 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:34:54,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:54,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:54,565 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:54,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,580 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:54,580 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:54,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:54,581 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:54,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001844912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:54,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:54,601 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:54,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480061849] [2021-06-05 04:34:54,601 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:54,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:54,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:54,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:54,601 INFO L87 Difference]: Start difference. First operand 1007 states and 3958 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:55,102 INFO L93 Difference]: Finished difference Result 1308 states and 5048 transitions. [2021-06-05 04:34:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:55,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:55,105 INFO L225 Difference]: With dead ends: 1308 [2021-06-05 04:34:55,105 INFO L226 Difference]: Without dead ends: 1308 [2021-06-05 04:34:55,105 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 423.7ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:34:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-06-05 04:34:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1016. [2021-06-05 04:34:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 3.9320197044334977) internal successors, (3991), 1015 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3991 transitions. [2021-06-05 04:34:55,126 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 3991 transitions. Word has length 19 [2021-06-05 04:34:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:55,126 INFO L482 AbstractCegarLoop]: Abstraction has 1016 states and 3991 transitions. [2021-06-05 04:34:55,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 3991 transitions. [2021-06-05 04:34:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:55,128 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:55,128 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:55,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 510 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6124 [2021-06-05 04:34:55,328 INFO L430 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1022038400, now seen corresponding path program 364 times [2021-06-05 04:34:55,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:55,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618074037] [2021-06-05 04:34:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:55,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:55,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618074037] [2021-06-05 04:34:55,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618074037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:55,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221832420] [2021-06-05 04:34:55,457 INFO L93 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 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:55,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:34:55,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:55,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:55,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:55,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:55,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:55,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:55,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:55,550 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:55,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:55,553 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:55,555 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,599 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:34:55,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:34:55,600 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:34:55,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:55,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:55,718 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:55,721 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,734 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:34:55,734 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:55,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:34:55,735 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:34:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:55,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221832420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:55,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:55,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:55,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900493110] [2021-06-05 04:34:55,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:55,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:55,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:55,756 INFO L87 Difference]: Start difference. First operand 1016 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:56,199 INFO L93 Difference]: Finished difference Result 1217 states and 4702 transitions. [2021-06-05 04:34:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:34:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:56,202 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 04:34:56,202 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 04:34:56,202 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 416.5ms TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 04:34:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 04:34:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1020. [2021-06-05 04:34:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9332679097154073) internal successors, (4008), 1019 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4008 transitions. [2021-06-05 04:34:56,214 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4008 transitions. Word has length 19 [2021-06-05 04:34:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:56,214 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4008 transitions. [2021-06-05 04:34:56,214 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4008 transitions. [2021-06-05 04:34:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:56,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:56,216 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:56,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6130,511 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:56,416 INFO L430 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1664344626, now seen corresponding path program 365 times [2021-06-05 04:34:56,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:56,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744256424] [2021-06-05 04:34:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:56,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:56,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744256424] [2021-06-05 04:34:56,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744256424] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:56,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824123957] [2021-06-05 04:34:56,509 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:56,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:34:56,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 04:34:56,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:56,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:56,593 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:56,596 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:56,600 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:56,602 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,656 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:34:56,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:34:56,657 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:34:56,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:34:56,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:34:56,876 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:56,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:56,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:56,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:56,903 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 04:34:56,903 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:56,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:56,904 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 04:34:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:56,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824123957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:56,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:56,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:34:56,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923157467] [2021-06-05 04:34:56,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:34:56,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:34:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:34:56,925 INFO L87 Difference]: Start difference. First operand 1020 states and 4008 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:57,577 INFO L93 Difference]: Finished difference Result 1360 states and 5213 transitions. [2021-06-05 04:34:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:34:57,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:57,579 INFO L225 Difference]: With dead ends: 1360 [2021-06-05 04:34:57,579 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 04:34:57,579 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 705.2ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:34:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 04:34:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1020. [2021-06-05 04:34:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.929342492639843) internal successors, (4004), 1019 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4004 transitions. [2021-06-05 04:34:57,592 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4004 transitions. Word has length 19 [2021-06-05 04:34:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:57,592 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4004 transitions. [2021-06-05 04:34:57,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4004 transitions. [2021-06-05 04:34:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:57,593 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:57,593 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:57,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 512 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6136 [2021-06-05 04:34:57,794 INFO L430 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash 459199470, now seen corresponding path program 366 times [2021-06-05 04:34:57,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:57,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533139825] [2021-06-05 04:34:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:57,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:57,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533139825] [2021-06-05 04:34:57,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533139825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:57,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659249677] [2021-06-05 04:34:57,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:57,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:34:57,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:34:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:57,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:58,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:58,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:58,024 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:58,027 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:58,029 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,073 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:34:58,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:34:58,074 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:34:58,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:58,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:58,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:58,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:58,182 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:58,184 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:58,215 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:34:58,215 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:34:58,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:58,216 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:34:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:58,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659249677] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:58,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:58,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:34:58,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230175717] [2021-06-05 04:34:58,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:34:58,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:58,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:34:58,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:34:58,276 INFO L87 Difference]: Start difference. First operand 1020 states and 4004 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:34:58,873 INFO L93 Difference]: Finished difference Result 1217 states and 4703 transitions. [2021-06-05 04:34:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:34:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:34:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:34:58,875 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 04:34:58,875 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 04:34:58,875 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 578.4ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:34:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 04:34:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1024. [2021-06-05 04:34:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 3.9266862170087977) internal successors, (4017), 1023 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 4017 transitions. [2021-06-05 04:34:58,887 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 4017 transitions. Word has length 19 [2021-06-05 04:34:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:34:58,887 INFO L482 AbstractCegarLoop]: Abstraction has 1024 states and 4017 transitions. [2021-06-05 04:34:58,887 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:34:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 4017 transitions. [2021-06-05 04:34:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:34:58,889 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:34:58,889 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:34:59,089 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 513 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6147 [2021-06-05 04:34:59,089 INFO L430 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:34:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:34:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -285753102, now seen corresponding path program 367 times [2021-06-05 04:34:59,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:34:59,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154630040] [2021-06-05 04:34:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:34:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:59,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:34:59,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154630040] [2021-06-05 04:34:59,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154630040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:59,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562318538] [2021-06-05 04:34:59,193 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:34:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:34:59,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:34:59,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:34:59,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:59,275 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:59,279 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:59,282 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:59,285 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,339 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:34:59,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:34:59,340 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:34:59,510 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:34:59,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:34:59,513 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:59,517 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:34:59,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:34:59,520 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:34:59,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:34:59,567 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 04:34:59,567 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:34:59,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:34:59,568 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 04:34:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:34:59,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562318538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:34:59,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:34:59,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:34:59,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466426238] [2021-06-05 04:34:59,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:34:59,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:34:59,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:34:59,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:34:59,614 INFO L87 Difference]: Start difference. First operand 1024 states and 4017 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:00,631 INFO L93 Difference]: Finished difference Result 1401 states and 5347 transitions. [2021-06-05 04:35:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 04:35:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:00,633 INFO L225 Difference]: With dead ends: 1401 [2021-06-05 04:35:00,633 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 04:35:00,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 978.1ms TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 04:35:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 04:35:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1014. [2021-06-05 04:35:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 3.9378084896347483) internal successors, (3989), 1013 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 3989 transitions. [2021-06-05 04:35:00,645 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 3989 transitions. Word has length 19 [2021-06-05 04:35:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:00,645 INFO L482 AbstractCegarLoop]: Abstraction has 1014 states and 3989 transitions. [2021-06-05 04:35:00,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 3989 transitions. [2021-06-05 04:35:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:00,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:00,647 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:00,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6155,514 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:00,847 INFO L430 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash -562698806, now seen corresponding path program 368 times [2021-06-05 04:35:00,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:00,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643164073] [2021-06-05 04:35:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:00,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:00,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643164073] [2021-06-05 04:35:00,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643164073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:00,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130170421] [2021-06-05 04:35:00,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:00,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:00,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:00,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:00,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:01,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:01,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:01,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:01,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:01,056 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:01,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:01,058 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:01,061 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,104 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:01,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:01,105 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:01,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:01,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:01,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:01,212 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,225 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:35:01,225 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:01,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:35:01,226 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:35:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:01,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130170421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:01,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:01,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:01,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398996953] [2021-06-05 04:35:01,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:01,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:01,247 INFO L87 Difference]: Start difference. First operand 1014 states and 3989 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:01,789 INFO L93 Difference]: Finished difference Result 1250 states and 4841 transitions. [2021-06-05 04:35:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:35:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:01,791 INFO L225 Difference]: With dead ends: 1250 [2021-06-05 04:35:01,791 INFO L226 Difference]: Without dead ends: 1250 [2021-06-05 04:35:01,792 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 494.1ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:35:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-06-05 04:35:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1019. [2021-06-05 04:35:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.93713163064833) internal successors, (4008), 1018 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4008 transitions. [2021-06-05 04:35:01,805 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4008 transitions. Word has length 19 [2021-06-05 04:35:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:01,805 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4008 transitions. [2021-06-05 04:35:01,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4008 transitions. [2021-06-05 04:35:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:01,806 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:01,806 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:02,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 515 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6165 [2021-06-05 04:35:02,007 INFO L430 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash 398399508, now seen corresponding path program 369 times [2021-06-05 04:35:02,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:02,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915119895] [2021-06-05 04:35:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:02,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:02,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915119895] [2021-06-05 04:35:02,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915119895] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:02,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345884249] [2021-06-05 04:35:02,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:02,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:35:02,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:02,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:02,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:02,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:02,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:02,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:02,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:02,231 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:02,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:02,234 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:02,237 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,280 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:02,280 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:02,281 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:02,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:02,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:02,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:02,400 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,414 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:35:02,414 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:02,414 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:35:02,414 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:35:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:02,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345884249] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:02,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:02,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:02,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857296780] [2021-06-05 04:35:02,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:02,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:02,435 INFO L87 Difference]: Start difference. First operand 1019 states and 4008 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:03,005 INFO L93 Difference]: Finished difference Result 1133 states and 4379 transitions. [2021-06-05 04:35:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:35:03,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:03,007 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 04:35:03,007 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 04:35:03,007 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 548.4ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:35:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 04:35:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 04:35:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9352941176470586) internal successors, (4014), 1020 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4014 transitions. [2021-06-05 04:35:03,018 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4014 transitions. Word has length 19 [2021-06-05 04:35:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:03,018 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4014 transitions. [2021-06-05 04:35:03,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4014 transitions. [2021-06-05 04:35:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:03,020 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:03,020 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:03,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6171,516 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:03,220 INFO L430 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 325027028, now seen corresponding path program 370 times [2021-06-05 04:35:03,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:03,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603060038] [2021-06-05 04:35:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:03,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:03,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603060038] [2021-06-05 04:35:03,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603060038] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:03,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753058640] [2021-06-05 04:35:03,366 INFO L93 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 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:03,392 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:35:03,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:03,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:03,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:03,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:03,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:03,455 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:03,458 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:03,461 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,505 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:03,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:03,506 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:03,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:03,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:03,607 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:03,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:03,610 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:03,613 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:03,643 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:35:03,643 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:03,643 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:03,644 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:35:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:03,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753058640] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:03,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:03,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:03,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83963880] [2021-06-05 04:35:03,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:03,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:03,697 INFO L87 Difference]: Start difference. First operand 1021 states and 4014 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:04,423 INFO L93 Difference]: Finished difference Result 1152 states and 4422 transitions. [2021-06-05 04:35:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:35:04,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:04,425 INFO L225 Difference]: With dead ends: 1152 [2021-06-05 04:35:04,425 INFO L226 Difference]: Without dead ends: 1152 [2021-06-05 04:35:04,425 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 678.6ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-06-05 04:35:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-06-05 04:35:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1026. [2021-06-05 04:35:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 3.937560975609756) internal successors, (4036), 1025 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 4036 transitions. [2021-06-05 04:35:04,437 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 4036 transitions. Word has length 19 [2021-06-05 04:35:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:04,437 INFO L482 AbstractCegarLoop]: Abstraction has 1026 states and 4036 transitions. [2021-06-05 04:35:04,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 4036 transitions. [2021-06-05 04:35:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:04,438 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:04,438 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:04,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 517 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6177 [2021-06-05 04:35:04,639 INFO L430 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 935184276, now seen corresponding path program 371 times [2021-06-05 04:35:04,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:04,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951337941] [2021-06-05 04:35:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:04,777 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:04,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951337941] [2021-06-05 04:35:04,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951337941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:04,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011056628] [2021-06-05 04:35:04,777 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:04,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:35:04,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:04,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:04,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:04,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:04,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:04,864 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:04,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:04,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:04,867 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:04,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:04,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:04,870 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:04,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:04,872 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:04,916 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:04,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:04,917 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:05,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:05,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:05,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:05,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:05,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:05,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:05,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:05,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:05,021 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:05,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:05,024 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:05,054 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:35:05,054 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:05,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:05,055 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:35:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:05,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011056628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:05,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:05,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:05,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189137107] [2021-06-05 04:35:05,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:05,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:05,117 INFO L87 Difference]: Start difference. First operand 1026 states and 4036 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:05,899 INFO L93 Difference]: Finished difference Result 1138 states and 4392 transitions. [2021-06-05 04:35:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:35:05,899 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:05,901 INFO L225 Difference]: With dead ends: 1138 [2021-06-05 04:35:05,901 INFO L226 Difference]: Without dead ends: 1136 [2021-06-05 04:35:05,901 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 756.9ms TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-06-05 04:35:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2021-06-05 04:35:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1022. [2021-06-05 04:35:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 3.9431929480901076) internal successors, (4026), 1021 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 4026 transitions. [2021-06-05 04:35:05,912 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 4026 transitions. Word has length 19 [2021-06-05 04:35:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:05,912 INFO L482 AbstractCegarLoop]: Abstraction has 1022 states and 4026 transitions. [2021-06-05 04:35:05,912 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 4026 transitions. [2021-06-05 04:35:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:05,914 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:05,914 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:06,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6185,518 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:06,114 INFO L430 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1361309204, now seen corresponding path program 372 times [2021-06-05 04:35:06,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:06,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986576724] [2021-06-05 04:35:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:06,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:06,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986576724] [2021-06-05 04:35:06,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986576724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:06,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612580697] [2021-06-05 04:35:06,221 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:06,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:35:06,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:06,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:06,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:06,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:06,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:06,307 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:06,311 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:06,314 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,368 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:06,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:06,369 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:06,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:06,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:06,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:06,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,595 INFO L628 ElimStorePlain]: treesize reduction 33, result has 35.3 percent of original size [2021-06-05 04:35:06,595 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:06,596 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:35:06,596 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:12 [2021-06-05 04:35:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:06,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612580697] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:06,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:06,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:06,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945288256] [2021-06-05 04:35:06,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:06,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:06,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:06,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:06,615 INFO L87 Difference]: Start difference. First operand 1022 states and 4026 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:06,946 INFO L93 Difference]: Finished difference Result 1121 states and 4348 transitions. [2021-06-05 04:35:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:35:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:06,948 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 04:35:06,948 INFO L226 Difference]: Without dead ends: 1121 [2021-06-05 04:35:06,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 436.3ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-06-05 04:35:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1027. [2021-06-05 04:35:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9444444444444446) internal successors, (4047), 1026 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4047 transitions. [2021-06-05 04:35:06,964 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4047 transitions. Word has length 19 [2021-06-05 04:35:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:06,964 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4047 transitions. [2021-06-05 04:35:06,964 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4047 transitions. [2021-06-05 04:35:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:06,966 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:06,966 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:07,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 519 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6195 [2021-06-05 04:35:07,189 INFO L430 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash -247275066, now seen corresponding path program 373 times [2021-06-05 04:35:07,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:07,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907169797] [2021-06-05 04:35:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:07,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:07,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907169797] [2021-06-05 04:35:07,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907169797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:07,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905146457] [2021-06-05 04:35:07,299 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:07,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:07,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:07,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:07,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:07,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:07,391 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:07,395 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,466 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:07,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:07,467 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:07,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:07,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:07,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:07,763 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:07,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:07,767 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:07,795 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 04:35:07,795 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:07,796 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:07,796 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 04:35:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:07,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905146457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:07,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:07,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:07,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283171439] [2021-06-05 04:35:07,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:07,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:07,822 INFO L87 Difference]: Start difference. First operand 1027 states and 4047 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:08,844 INFO L93 Difference]: Finished difference Result 1255 states and 4792 transitions. [2021-06-05 04:35:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 04:35:08,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:08,846 INFO L225 Difference]: With dead ends: 1255 [2021-06-05 04:35:08,846 INFO L226 Difference]: Without dead ends: 1247 [2021-06-05 04:35:08,846 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1060.3ms TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:35:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2021-06-05 04:35:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1027. [2021-06-05 04:35:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9405458089668617) internal successors, (4043), 1026 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4043 transitions. [2021-06-05 04:35:08,860 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4043 transitions. Word has length 19 [2021-06-05 04:35:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:08,860 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4043 transitions. [2021-06-05 04:35:08,860 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4043 transitions. [2021-06-05 04:35:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:08,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:08,862 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:09,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 520 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6202 [2021-06-05 04:35:09,062 INFO L430 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:09,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1452420222, now seen corresponding path program 374 times [2021-06-05 04:35:09,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:09,062 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213610154] [2021-06-05 04:35:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:09,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:09,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213610154] [2021-06-05 04:35:09,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213610154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:09,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183000166] [2021-06-05 04:35:09,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:09,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:09,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:09,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:09,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:09,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:09,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:09,251 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:09,255 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:09,258 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,311 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:09,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:09,312 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:09,505 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:35:09,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:09,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:09,512 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:09,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:09,515 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:09,518 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:09,563 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 04:35:09,563 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:35:09,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:09,564 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 04:35:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:09,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183000166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:09,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:09,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:09,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756582340] [2021-06-05 04:35:09,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:09,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:09,610 INFO L87 Difference]: Start difference. First operand 1027 states and 4043 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:09,988 INFO L93 Difference]: Finished difference Result 1136 states and 4375 transitions. [2021-06-05 04:35:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:35:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:09,991 INFO L225 Difference]: With dead ends: 1136 [2021-06-05 04:35:09,991 INFO L226 Difference]: Without dead ends: 1136 [2021-06-05 04:35:09,991 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 458.4ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:35:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2021-06-05 04:35:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1031. [2021-06-05 04:35:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 3.9456310679611653) internal successors, (4064), 1030 states have internal predecessors, (4064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 4064 transitions. [2021-06-05 04:35:10,002 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 4064 transitions. Word has length 19 [2021-06-05 04:35:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:10,002 INFO L482 AbstractCegarLoop]: Abstraction has 1031 states and 4064 transitions. [2021-06-05 04:35:10,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 4064 transitions. [2021-06-05 04:35:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:10,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:10,004 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:10,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 521 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6213 [2021-06-05 04:35:10,204 INFO L430 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash -257384048, now seen corresponding path program 375 times [2021-06-05 04:35:10,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:10,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021954433] [2021-06-05 04:35:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:10,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:10,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021954433] [2021-06-05 04:35:10,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021954433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:10,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653659681] [2021-06-05 04:35:10,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:10,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 04:35:10,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:10,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:10,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:10,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:10,402 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:10,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:10,410 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:10,413 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,467 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:10,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:10,468 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:10,648 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:35:10,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:10,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:10,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:10,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:10,658 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:10,661 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:10,706 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 04:35:10,706 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:35:10,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:10,707 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 04:35:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:10,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653659681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:10,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:10,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:10,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539658769] [2021-06-05 04:35:10,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:10,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:10,764 INFO L87 Difference]: Start difference. First operand 1031 states and 4064 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:12,016 INFO L93 Difference]: Finished difference Result 1370 states and 5134 transitions. [2021-06-05 04:35:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 04:35:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:12,019 INFO L225 Difference]: With dead ends: 1370 [2021-06-05 04:35:12,019 INFO L226 Difference]: Without dead ends: 1366 [2021-06-05 04:35:12,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1156.6ms TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 04:35:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-06-05 04:35:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1036. [2021-06-05 04:35:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 3.9458937198067634) internal successors, (4084), 1035 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 4084 transitions. [2021-06-05 04:35:12,031 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 4084 transitions. Word has length 19 [2021-06-05 04:35:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:12,031 INFO L482 AbstractCegarLoop]: Abstraction has 1036 states and 4084 transitions. [2021-06-05 04:35:12,031 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 4084 transitions. [2021-06-05 04:35:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:12,032 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:12,032 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:12,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 522 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6223 [2021-06-05 04:35:12,233 INFO L430 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1171571058, now seen corresponding path program 376 times [2021-06-05 04:35:12,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:12,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118996177] [2021-06-05 04:35:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:12,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:12,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118996177] [2021-06-05 04:35:12,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118996177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:12,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070989858] [2021-06-05 04:35:12,334 INFO L93 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 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:12,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:35:12,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:12,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:12,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:12,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:12,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:12,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:12,422 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:12,425 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,478 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:12,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:12,479 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:12,671 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:35:12,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:12,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:12,679 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:12,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:12,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:12,685 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:12,731 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 04:35:12,731 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:35:12,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:12,732 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 04:35:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:12,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070989858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:12,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:12,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:12,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316046773] [2021-06-05 04:35:12,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:12,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:12,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:12,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:12,788 INFO L87 Difference]: Start difference. First operand 1036 states and 4084 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:13,183 INFO L93 Difference]: Finished difference Result 1128 states and 4367 transitions. [2021-06-05 04:35:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 04:35:13,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:13,185 INFO L225 Difference]: With dead ends: 1128 [2021-06-05 04:35:13,185 INFO L226 Difference]: Without dead ends: 1124 [2021-06-05 04:35:13,185 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 494.0ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 04:35:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-06-05 04:35:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1036. [2021-06-05 04:35:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 3.9420289855072466) internal successors, (4080), 1035 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 4080 transitions. [2021-06-05 04:35:13,196 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 4080 transitions. Word has length 19 [2021-06-05 04:35:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:13,196 INFO L482 AbstractCegarLoop]: Abstraction has 1036 states and 4080 transitions. [2021-06-05 04:35:13,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 4080 transitions. [2021-06-05 04:35:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:13,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:13,198 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:13,398 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 523 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6233 [2021-06-05 04:35:13,398 INFO L430 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2097594502, now seen corresponding path program 377 times [2021-06-05 04:35:13,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:13,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309189798] [2021-06-05 04:35:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:13,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:13,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309189798] [2021-06-05 04:35:13,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309189798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:13,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516344738] [2021-06-05 04:35:13,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:13,543 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:13,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:13,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:13,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:13,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:13,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:13,603 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:13,606 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:13,609 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,664 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:13,664 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:13,665 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:13,849 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 04:35:13,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:13,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:13,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:13,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:13,859 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:13,862 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:13,917 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 04:35:13,917 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 04:35:13,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:13,918 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 04:35:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:13,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516344738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:13,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:13,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:13,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517428806] [2021-06-05 04:35:13,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:13,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:13,964 INFO L87 Difference]: Start difference. First operand 1036 states and 4080 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:15,061 INFO L93 Difference]: Finished difference Result 1363 states and 5138 transitions. [2021-06-05 04:35:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 04:35:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:15,063 INFO L225 Difference]: With dead ends: 1363 [2021-06-05 04:35:15,063 INFO L226 Difference]: Without dead ends: 1363 [2021-06-05 04:35:15,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1067.0ms TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 04:35:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2021-06-05 04:35:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1023. [2021-06-05 04:35:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 04:35:15,075 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 04:35:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:15,075 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 04:35:15,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 04:35:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:15,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:15,077 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:15,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 524 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6245 [2021-06-05 04:35:15,277 INFO L430 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -903503812, now seen corresponding path program 378 times [2021-06-05 04:35:15,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:15,278 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904996548] [2021-06-05 04:35:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:15,416 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:15,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904996548] [2021-06-05 04:35:15,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904996548] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:15,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919537666] [2021-06-05 04:35:15,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:15,445 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:35:15,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:15,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:15,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:15,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:15,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:15,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:15,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:15,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:15,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:15,514 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:15,516 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,569 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:15,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:15,570 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:15,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:15,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:15,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:15,704 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,717 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 04:35:15,717 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:15,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:35:15,718 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 04:35:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:15,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919537666] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:15,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:15,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:15,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499585889] [2021-06-05 04:35:15,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:15,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:15,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:15,739 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:16,322 INFO L93 Difference]: Finished difference Result 1117 states and 4339 transitions. [2021-06-05 04:35:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 04:35:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:16,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:16,324 INFO L225 Difference]: With dead ends: 1117 [2021-06-05 04:35:16,324 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 04:35:16,324 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 587.5ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 04:35:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 04:35:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1025. [2021-06-05 04:35:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.94140625) internal successors, (4036), 1024 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4036 transitions. [2021-06-05 04:35:16,335 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4036 transitions. Word has length 19 [2021-06-05 04:35:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:16,335 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4036 transitions. [2021-06-05 04:35:16,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4036 transitions. [2021-06-05 04:35:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:16,336 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:16,336 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:16,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 525 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6255 [2021-06-05 04:35:16,537 INFO L430 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1718309966, now seen corresponding path program 379 times [2021-06-05 04:35:16,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:16,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910719934] [2021-06-05 04:35:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:16,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:16,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910719934] [2021-06-05 04:35:16,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910719934] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:16,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33338824] [2021-06-05 04:35:16,691 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:16,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:16,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:16,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:16,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:16,781 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:16,784 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:16,787 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,830 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:16,831 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:16,831 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:16,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:16,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:16,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:16,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:16,950 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:16,954 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:16,984 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 04:35:16,984 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:16,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:16,985 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 04:35:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:17,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33338824] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:17,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:17,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:17,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822013356] [2021-06-05 04:35:17,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:17,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:17,047 INFO L87 Difference]: Start difference. First operand 1025 states and 4036 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:17,765 INFO L93 Difference]: Finished difference Result 1123 states and 4344 transitions. [2021-06-05 04:35:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 04:35:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:17,767 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 04:35:17,767 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 04:35:17,767 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 779.8ms TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-06-05 04:35:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 04:35:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1023. [2021-06-05 04:35:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 04:35:17,779 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 04:35:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:17,779 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 04:35:17,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 04:35:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:17,780 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:17,780 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:17,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 526 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6261 [2021-06-05 04:35:17,980 INFO L430 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1756882480, now seen corresponding path program 380 times [2021-06-05 04:35:17,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:17,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095569345] [2021-06-05 04:35:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:18,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:18,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095569345] [2021-06-05 04:35:18,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095569345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:18,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949791913] [2021-06-05 04:35:18,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:18,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:18,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:18,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:18,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:18,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:18,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:18,175 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:18,178 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:18,181 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,235 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:18,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:18,236 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:18,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:18,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:18,433 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:18,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:18,436 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:18,439 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:18,459 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 04:35:18,460 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:18,460 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 04:35:18,461 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 04:35:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:18,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949791913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:18,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:18,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:18,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640944903] [2021-06-05 04:35:18,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:18,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:18,481 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:19,192 INFO L93 Difference]: Finished difference Result 1220 states and 4683 transitions. [2021-06-05 04:35:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:35:19,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:19,194 INFO L225 Difference]: With dead ends: 1220 [2021-06-05 04:35:19,194 INFO L226 Difference]: Without dead ends: 1212 [2021-06-05 04:35:19,194 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 780.8ms TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:35:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-06-05 04:35:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1023. [2021-06-05 04:35:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 04:35:19,206 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 04:35:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:19,206 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 04:35:19,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 04:35:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:19,207 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:19,207 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:19,408 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6269,527 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:19,408 INFO L430 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 263537936, now seen corresponding path program 381 times [2021-06-05 04:35:19,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:19,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784169997] [2021-06-05 04:35:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:19,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:19,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784169997] [2021-06-05 04:35:19,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784169997] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:19,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722792419] [2021-06-05 04:35:19,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:19,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:35:19,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:19,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:19,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:19,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:19,609 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:19,613 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:19,616 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,669 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:19,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:19,670 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:19,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:19,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:19,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:19,816 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:19,819 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:19,822 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:19,825 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:19,837 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:19,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:19,841 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:19,889 INFO L628 ElimStorePlain]: treesize reduction 66, result has 42.6 percent of original size [2021-06-05 04:35:19,890 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:19,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:19,890 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:183, output treesize:49 [2021-06-05 04:35:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:19,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722792419] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:19,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:19,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:19,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136551722] [2021-06-05 04:35:19,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:19,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:19,950 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:20,831 INFO L93 Difference]: Finished difference Result 1232 states and 4700 transitions. [2021-06-05 04:35:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 04:35:20,831 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:20,833 INFO L225 Difference]: With dead ends: 1232 [2021-06-05 04:35:20,833 INFO L226 Difference]: Without dead ends: 1227 [2021-06-05 04:35:20,834 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 985.8ms TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:35:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2021-06-05 04:35:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1027. [2021-06-05 04:35:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.935672514619883) internal successors, (4038), 1026 states have internal predecessors, (4038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4038 transitions. [2021-06-05 04:35:20,845 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4038 transitions. Word has length 19 [2021-06-05 04:35:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:20,845 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4038 transitions. [2021-06-05 04:35:20,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4038 transitions. [2021-06-05 04:35:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:20,847 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:20,847 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:21,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 528 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6279 [2021-06-05 04:35:21,047 INFO L430 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 190165456, now seen corresponding path program 382 times [2021-06-05 04:35:21,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:21,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078956805] [2021-06-05 04:35:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:21,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:21,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078956805] [2021-06-05 04:35:21,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078956805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:21,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539842826] [2021-06-05 04:35:21,162 INFO L93 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 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:21,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:35:21,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:21,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:21,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:21,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:21,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:21,247 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:21,250 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:21,253 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,307 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:21,307 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:21,307 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:21,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:21,446 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:21,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:21,453 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:21,456 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:21,459 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:21,461 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:21,464 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:21,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:21,468 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:21,515 INFO L628 ElimStorePlain]: treesize reduction 66, result has 42.6 percent of original size [2021-06-05 04:35:21,516 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:21,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:21,516 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:183, output treesize:49 [2021-06-05 04:35:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:21,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539842826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:21,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:21,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:21,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013588687] [2021-06-05 04:35:21,577 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:21,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:21,577 INFO L87 Difference]: Start difference. First operand 1027 states and 4038 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:22,394 INFO L93 Difference]: Finished difference Result 1215 states and 4673 transitions. [2021-06-05 04:35:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 04:35:22,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:22,397 INFO L225 Difference]: With dead ends: 1215 [2021-06-05 04:35:22,397 INFO L226 Difference]: Without dead ends: 1211 [2021-06-05 04:35:22,397 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 963.5ms TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-06-05 04:35:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-06-05 04:35:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1023. [2021-06-05 04:35:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.9422700587084147) internal successors, (4029), 1022 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4029 transitions. [2021-06-05 04:35:22,408 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4029 transitions. Word has length 19 [2021-06-05 04:35:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:22,408 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4029 transitions. [2021-06-05 04:35:22,408 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4029 transitions. [2021-06-05 04:35:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:22,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:22,409 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:22,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 529 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6287 [2021-06-05 04:35:22,610 INFO L430 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:22,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash -696410830, now seen corresponding path program 383 times [2021-06-05 04:35:22,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:22,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702511202] [2021-06-05 04:35:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:22,739 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:22,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702511202] [2021-06-05 04:35:22,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702511202] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:22,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524185021] [2021-06-05 04:35:22,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:22,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:22,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:22,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:22,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:22,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:22,824 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:22,828 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:22,830 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,884 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:22,885 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:22,885 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:22,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:22,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:22,981 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:22,985 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:22,989 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:22,993 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:22,997 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:22,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:22,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:23,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:23,000 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:23,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:23,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:23,003 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:23,071 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:23,071 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:23,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:23,072 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:23,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524185021] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:23,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:23,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:23,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000169989] [2021-06-05 04:35:23,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:23,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:23,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:23,178 INFO L87 Difference]: Start difference. First operand 1023 states and 4029 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:23,716 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:23,917 INFO L93 Difference]: Finished difference Result 1236 states and 4674 transitions. [2021-06-05 04:35:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:35:23,918 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:23,919 INFO L225 Difference]: With dead ends: 1236 [2021-06-05 04:35:23,919 INFO L226 Difference]: Without dead ends: 1236 [2021-06-05 04:35:23,920 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 809.0ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:35:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2021-06-05 04:35:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1033. [2021-06-05 04:35:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 3.9544573643410854) internal successors, (4081), 1032 states have internal predecessors, (4081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 4081 transitions. [2021-06-05 04:35:23,932 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 4081 transitions. Word has length 19 [2021-06-05 04:35:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:23,932 INFO L482 AbstractCegarLoop]: Abstraction has 1033 states and 4081 transitions. [2021-06-05 04:35:23,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 4081 transitions. [2021-06-05 04:35:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:23,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:23,933 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:24,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6295,530 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:24,134 INFO L430 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 498625344, now seen corresponding path program 384 times [2021-06-05 04:35:24,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:24,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361578899] [2021-06-05 04:35:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:24,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:24,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361578899] [2021-06-05 04:35:24,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361578899] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:24,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005030372] [2021-06-05 04:35:24,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:24,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 04:35:24,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:24,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:24,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:24,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:24,338 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:24,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:24,344 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:24,347 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,401 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:24,402 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:24,402 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:24,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:24,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:24,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:24,501 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:24,505 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:24,509 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:24,513 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:24,516 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:24,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:24,519 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:24,586 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:24,586 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:24,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:24,587 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:24,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005030372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:24,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:24,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:24,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333326196] [2021-06-05 04:35:24,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:24,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:24,700 INFO L87 Difference]: Start difference. First operand 1033 states and 4081 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:25,628 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:26,273 INFO L93 Difference]: Finished difference Result 1429 states and 5291 transitions. [2021-06-05 04:35:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 04:35:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:26,276 INFO L225 Difference]: With dead ends: 1429 [2021-06-05 04:35:26,276 INFO L226 Difference]: Without dead ends: 1424 [2021-06-05 04:35:26,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1563.2ms TimeCoverageRelationStatistics Valid=264, Invalid=1376, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 04:35:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-06-05 04:35:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1044. [2021-06-05 04:35:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.9606903163950142) internal successors, (4131), 1043 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 4131 transitions. [2021-06-05 04:35:26,289 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 4131 transitions. Word has length 19 [2021-06-05 04:35:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:26,289 INFO L482 AbstractCegarLoop]: Abstraction has 1044 states and 4131 transitions. [2021-06-05 04:35:26,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 4131 transitions. [2021-06-05 04:35:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:26,291 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:26,291 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:26,491 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6303,531 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:26,491 INFO L430 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1927580450, now seen corresponding path program 385 times [2021-06-05 04:35:26,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:26,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865000429] [2021-06-05 04:35:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:26,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:26,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865000429] [2021-06-05 04:35:26,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865000429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:26,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443757014] [2021-06-05 04:35:26,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:26,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:26,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:26,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:26,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:26,709 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:26,712 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,766 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:26,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:26,767 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:26,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:26,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:26,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:26,877 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:26,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:26,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:26,890 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:26,894 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:26,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:26,898 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:26,967 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:26,967 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:26,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:26,968 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:27,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443757014] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:27,072 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:27,072 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:27,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770624426] [2021-06-05 04:35:27,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:27,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:27,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:27,073 INFO L87 Difference]: Start difference. First operand 1044 states and 4131 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:27,594 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:27,808 INFO L93 Difference]: Finished difference Result 1204 states and 4599 transitions. [2021-06-05 04:35:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:35:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:27,811 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 04:35:27,811 INFO L226 Difference]: Without dead ends: 1200 [2021-06-05 04:35:27,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 841.5ms TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:35:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2021-06-05 04:35:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1045. [2021-06-05 04:35:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 3.9559386973180075) internal successors, (4130), 1044 states have internal predecessors, (4130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 4130 transitions. [2021-06-05 04:35:27,823 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 4130 transitions. Word has length 19 [2021-06-05 04:35:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:27,823 INFO L482 AbstractCegarLoop]: Abstraction has 1045 states and 4130 transitions. [2021-06-05 04:35:27,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 4130 transitions. [2021-06-05 04:35:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:27,824 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:27,824 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:28,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6313,532 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:28,025 INFO L430 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1441363402, now seen corresponding path program 386 times [2021-06-05 04:35:28,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:28,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743671816] [2021-06-05 04:35:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:28,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:28,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743671816] [2021-06-05 04:35:28,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743671816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:28,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736338443] [2021-06-05 04:35:28,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:28,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:28,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:28,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:28,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:28,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:28,230 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:28,234 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:28,237 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:28,240 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,294 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:28,294 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:28,295 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:28,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:28,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:28,390 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:28,394 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:28,398 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:28,402 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:28,405 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:28,409 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:28,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:28,412 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:28,479 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:28,479 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:28,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:28,480 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:28,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736338443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:28,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:28,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:28,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079326889] [2021-06-05 04:35:28,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:28,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:28,574 INFO L87 Difference]: Start difference. First operand 1045 states and 4130 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:29,601 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:30,140 INFO L93 Difference]: Finished difference Result 1402 states and 5250 transitions. [2021-06-05 04:35:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 04:35:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:30,142 INFO L225 Difference]: With dead ends: 1402 [2021-06-05 04:35:30,142 INFO L226 Difference]: Without dead ends: 1402 [2021-06-05 04:35:30,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1499.4ms TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 04:35:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2021-06-05 04:35:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1038. [2021-06-05 04:35:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 3.9546769527483123) internal successors, (4101), 1037 states have internal predecessors, (4101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 4101 transitions. [2021-06-05 04:35:30,155 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 4101 transitions. Word has length 19 [2021-06-05 04:35:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:30,155 INFO L482 AbstractCegarLoop]: Abstraction has 1038 states and 4101 transitions. [2021-06-05 04:35:30,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 4101 transitions. [2021-06-05 04:35:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:30,156 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:30,156 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:30,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 533 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6323 [2021-06-05 04:35:30,356 INFO L430 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -353827318, now seen corresponding path program 387 times [2021-06-05 04:35:30,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:30,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147269040] [2021-06-05 04:35:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:30,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:30,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147269040] [2021-06-05 04:35:30,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147269040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:30,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773424334] [2021-06-05 04:35:30,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:30,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:35:30,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:30,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:30,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:30,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:30,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:30,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:30,604 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:30,607 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,650 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:30,650 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:30,650 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:30,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:30,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:30,745 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:30,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:30,751 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,753 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:35:30,754 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:30,757 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:30,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:30,760 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:30,763 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:30,817 INFO L628 ElimStorePlain]: treesize reduction 74, result has 41.7 percent of original size [2021-06-05 04:35:30,818 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:30,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:30,818 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:215, output treesize:53 [2021-06-05 04:35:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:30,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773424334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:30,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:30,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:30,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145172675] [2021-06-05 04:35:30,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:30,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:30,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:30,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:30,912 INFO L87 Difference]: Start difference. First operand 1038 states and 4101 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:31,646 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-06-05 04:35:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:32,011 INFO L93 Difference]: Finished difference Result 1239 states and 4682 transitions. [2021-06-05 04:35:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:35:32,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:32,013 INFO L225 Difference]: With dead ends: 1239 [2021-06-05 04:35:32,013 INFO L226 Difference]: Without dead ends: 1239 [2021-06-05 04:35:32,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1089.0ms TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2021-06-05 04:35:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2021-06-05 04:35:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1034. [2021-06-05 04:35:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.9496611810261375) internal successors, (4080), 1033 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 4080 transitions. [2021-06-05 04:35:32,024 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 4080 transitions. Word has length 19 [2021-06-05 04:35:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:32,024 INFO L482 AbstractCegarLoop]: Abstraction has 1034 states and 4080 transitions. [2021-06-05 04:35:32,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 4080 transitions. [2021-06-05 04:35:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:32,026 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:32,026 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:32,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6331,534 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:32,226 INFO L430 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:32,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1617886036, now seen corresponding path program 388 times [2021-06-05 04:35:32,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:32,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936053898] [2021-06-05 04:35:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:32,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:32,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936053898] [2021-06-05 04:35:32,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936053898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:32,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338633743] [2021-06-05 04:35:32,386 INFO L93 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 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:32,412 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:35:32,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:32,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:32,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:32,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:32,472 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:32,475 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:32,477 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:32,480 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,523 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:32,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:32,524 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:32,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:32,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:32,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:32,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:32,617 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,619 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:35:32,620 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:32,623 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:32,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:32,626 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:32,628 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:32,683 INFO L628 ElimStorePlain]: treesize reduction 74, result has 41.7 percent of original size [2021-06-05 04:35:32,684 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:32,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:32,684 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:215, output treesize:53 [2021-06-05 04:35:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:32,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338633743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:32,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:32,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:32,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417977919] [2021-06-05 04:35:32,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:32,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:32,788 INFO L87 Difference]: Start difference. First operand 1034 states and 4080 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:33,523 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-06-05 04:35:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:33,859 INFO L93 Difference]: Finished difference Result 1179 states and 4524 transitions. [2021-06-05 04:35:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 04:35:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:33,862 INFO L225 Difference]: With dead ends: 1179 [2021-06-05 04:35:33,862 INFO L226 Difference]: Without dead ends: 1177 [2021-06-05 04:35:33,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1124.2ms TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2021-06-05 04:35:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2021-06-05 04:35:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1032. [2021-06-05 04:35:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 3.949563530552861) internal successors, (4072), 1031 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 4072 transitions. [2021-06-05 04:35:33,873 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 4072 transitions. Word has length 19 [2021-06-05 04:35:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:33,873 INFO L482 AbstractCegarLoop]: Abstraction has 1032 states and 4072 transitions. [2021-06-05 04:35:33,873 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 4072 transitions. [2021-06-05 04:35:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:33,875 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:33,875 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:34,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 535 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6339 [2021-06-05 04:35:34,075 INFO L430 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -242808330, now seen corresponding path program 389 times [2021-06-05 04:35:34,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:34,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702081037] [2021-06-05 04:35:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:34,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:34,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702081037] [2021-06-05 04:35:34,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702081037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:34,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198156332] [2021-06-05 04:35:34,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:34,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 04:35:34,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:34,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:34,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:34,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:34,274 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:34,277 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:34,281 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,283 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:34,284 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,337 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:34,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:34,338 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:34,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:34,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:34,432 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:34,436 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:34,439 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:34,443 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:34,447 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:34,450 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:34,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:34,453 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:34,521 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:34,522 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:34,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:34,523 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:34,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198156332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:34,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:34,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:34,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066877169] [2021-06-05 04:35:34,646 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:34,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:34,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:34,647 INFO L87 Difference]: Start difference. First operand 1032 states and 4072 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:35,507 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:35,708 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-06-05 04:35:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:36,027 INFO L93 Difference]: Finished difference Result 1339 states and 5048 transitions. [2021-06-05 04:35:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 04:35:36,027 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:36,029 INFO L225 Difference]: With dead ends: 1339 [2021-06-05 04:35:36,029 INFO L226 Difference]: Without dead ends: 1334 [2021-06-05 04:35:36,030 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1453.0ms TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 04:35:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2021-06-05 04:35:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1034. [2021-06-05 04:35:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.945788964181994) internal successors, (4076), 1033 states have internal predecessors, (4076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 4076 transitions. [2021-06-05 04:35:36,042 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 4076 transitions. Word has length 19 [2021-06-05 04:35:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:36,042 INFO L482 AbstractCegarLoop]: Abstraction has 1034 states and 4076 transitions. [2021-06-05 04:35:36,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 4076 transitions. [2021-06-05 04:35:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:36,043 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:36,043 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:36,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6349,536 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:36,244 INFO L430 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:36,244 INFO L82 PathProgramCache]: Analyzing trace with hash -316180810, now seen corresponding path program 390 times [2021-06-05 04:35:36,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:36,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764038500] [2021-06-05 04:35:36,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:36,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:36,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764038500] [2021-06-05 04:35:36,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764038500] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:36,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262799689] [2021-06-05 04:35:36,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:36,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 04:35:36,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:36,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:36,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:36,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:36,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:36,451 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:36,455 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:36,457 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,511 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:36,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:36,512 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:36,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:36,603 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:36,606 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:36,610 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:36,614 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:36,618 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:36,621 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:36,625 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:36,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:36,628 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:36,704 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:36,704 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:36,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:36,705 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:36,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262799689] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:36,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:36,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:36,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981411380] [2021-06-05 04:35:36,829 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:36,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:36,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:36,830 INFO L87 Difference]: Start difference. First operand 1034 states and 4076 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:37,697 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:37,900 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-06-05 04:35:38,237 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-06-05 04:35:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:38,293 INFO L93 Difference]: Finished difference Result 1320 states and 5017 transitions. [2021-06-05 04:35:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 04:35:38,293 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:38,295 INFO L225 Difference]: With dead ends: 1320 [2021-06-05 04:35:38,295 INFO L226 Difference]: Without dead ends: 1317 [2021-06-05 04:35:38,295 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1531.3ms TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 04:35:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-06-05 04:35:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1033. [2021-06-05 04:35:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 3.9467054263565893) internal successors, (4073), 1032 states have internal predecessors, (4073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 4073 transitions. [2021-06-05 04:35:38,308 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 4073 transitions. Word has length 19 [2021-06-05 04:35:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:38,308 INFO L482 AbstractCegarLoop]: Abstraction has 1033 states and 4073 transitions. [2021-06-05 04:35:38,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 4073 transitions. [2021-06-05 04:35:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:38,309 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:38,309 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:38,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6359,537 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:38,510 INFO L430 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash -981887596, now seen corresponding path program 391 times [2021-06-05 04:35:38,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:38,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401854943] [2021-06-05 04:35:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:38,636 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:38,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401854943] [2021-06-05 04:35:38,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401854943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:38,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487883144] [2021-06-05 04:35:38,636 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:38,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:38,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:38,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:38,720 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:38,723 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:38,726 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,779 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:38,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:38,780 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:38,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:38,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:38,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:38,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:38,882 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:38,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:38,889 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:38,893 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:38,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:38,896 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:38,963 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:38,964 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:38,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:38,964 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:39,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487883144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:39,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:39,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:39,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177785920] [2021-06-05 04:35:39,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:39,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:39,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:39,086 INFO L87 Difference]: Start difference. First operand 1033 states and 4073 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:39,590 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:39,763 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-06-05 04:35:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:39,864 INFO L93 Difference]: Finished difference Result 1169 states and 4492 transitions. [2021-06-05 04:35:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 04:35:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:39,866 INFO L225 Difference]: With dead ends: 1169 [2021-06-05 04:35:39,866 INFO L226 Difference]: Without dead ends: 1165 [2021-06-05 04:35:39,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 904.0ms TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-06-05 04:35:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-06-05 04:35:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1036. [2021-06-05 04:35:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 3.9420289855072466) internal successors, (4080), 1035 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 4080 transitions. [2021-06-05 04:35:39,878 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 4080 transitions. Word has length 19 [2021-06-05 04:35:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:39,878 INFO L482 AbstractCegarLoop]: Abstraction has 1036 states and 4080 transitions. [2021-06-05 04:35:39,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 4080 transitions. [2021-06-05 04:35:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:39,879 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:39,879 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:40,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6369,538 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:40,080 INFO L430 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2079215172, now seen corresponding path program 392 times [2021-06-05 04:35:40,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:40,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230226456] [2021-06-05 04:35:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:40,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:40,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230226456] [2021-06-05 04:35:40,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230226456] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:40,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951074738] [2021-06-05 04:35:40,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:40,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:40,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:40,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:40,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:40,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:40,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:40,317 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:40,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:40,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,366 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 04:35:40,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:40,367 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 04:35:40,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:40,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:40,452 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:40,456 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:40,459 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,461 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 04:35:40,461 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:40,464 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:40,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:40,467 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:40,470 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:40,525 INFO L628 ElimStorePlain]: treesize reduction 74, result has 41.7 percent of original size [2021-06-05 04:35:40,525 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:40,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:40,526 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:215, output treesize:53 [2021-06-05 04:35:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:40,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951074738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:40,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:40,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 04:35:40,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84618728] [2021-06-05 04:35:40,637 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 04:35:40,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 04:35:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 04:35:40,638 INFO L87 Difference]: Start difference. First operand 1036 states and 4080 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:41,445 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2021-06-05 04:35:41,896 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2021-06-05 04:35:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:42,047 INFO L93 Difference]: Finished difference Result 1258 states and 4718 transitions. [2021-06-05 04:35:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 04:35:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:42,049 INFO L225 Difference]: With dead ends: 1258 [2021-06-05 04:35:42,049 INFO L226 Difference]: Without dead ends: 1255 [2021-06-05 04:35:42,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1412.8ms TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 04:35:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-06-05 04:35:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1033. [2021-06-05 04:35:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 3.945736434108527) internal successors, (4072), 1032 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 4072 transitions. [2021-06-05 04:35:42,061 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 4072 transitions. Word has length 19 [2021-06-05 04:35:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:42,061 INFO L482 AbstractCegarLoop]: Abstraction has 1033 states and 4072 transitions. [2021-06-05 04:35:42,061 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 4072 transitions. [2021-06-05 04:35:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:42,063 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:42,063 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:42,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6379,539 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:42,263 INFO L430 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1139881338, now seen corresponding path program 393 times [2021-06-05 04:35:42,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:42,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397542197] [2021-06-05 04:35:42,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:42,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:42,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397542197] [2021-06-05 04:35:42,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397542197] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:42,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119100207] [2021-06-05 04:35:42,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:42,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 04:35:42,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:42,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:42,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:42,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:42,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:42,472 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:42,476 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:42,478 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,532 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:42,533 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:42,533 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:42,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:42,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:42,630 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:42,633 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:42,638 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:42,642 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:42,646 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:42,650 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:42,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:42,653 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:42,730 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:42,730 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:42,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:42,731 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:42,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119100207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:42,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:42,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:42,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060906298] [2021-06-05 04:35:42,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:42,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:42,828 INFO L87 Difference]: Start difference. First operand 1033 states and 4072 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:43,945 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:44,397 INFO L93 Difference]: Finished difference Result 1348 states and 5107 transitions. [2021-06-05 04:35:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 04:35:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:44,399 INFO L225 Difference]: With dead ends: 1348 [2021-06-05 04:35:44,399 INFO L226 Difference]: Without dead ends: 1348 [2021-06-05 04:35:44,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1571.1ms TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 04:35:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2021-06-05 04:35:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1031. [2021-06-05 04:35:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 3.940776699029126) internal successors, (4059), 1030 states have internal predecessors, (4059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 4059 transitions. [2021-06-05 04:35:44,411 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 4059 transitions. Word has length 19 [2021-06-05 04:35:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:44,411 INFO L482 AbstractCegarLoop]: Abstraction has 1031 states and 4059 transitions. [2021-06-05 04:35:44,411 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 4059 transitions. [2021-06-05 04:35:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:44,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:44,412 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:44,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6389,540 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:44,613 INFO L430 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash 221674768, now seen corresponding path program 394 times [2021-06-05 04:35:44,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:44,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123364131] [2021-06-05 04:35:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:44,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:44,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123364131] [2021-06-05 04:35:44,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123364131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:44,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488383244] [2021-06-05 04:35:44,735 INFO L93 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 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:44,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 04:35:44,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:44,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:44,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:44,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:44,835 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:44,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:44,839 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:44,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:44,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:44,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:44,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:44,847 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:44,914 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 04:35:44,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:44,915 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 04:35:45,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 04:35:45,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 04:35:45,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:45,033 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:45,037 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 04:35:45,041 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:45,045 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:45,048 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:45,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:45,051 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:45,118 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 04:35:45,118 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:45,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 04:35:45,119 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 04:35:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:45,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488383244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:45,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:45,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:45,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103395282] [2021-06-05 04:35:45,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:45,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:45,232 INFO L87 Difference]: Start difference. First operand 1031 states and 4059 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:46,295 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 04:35:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 04:35:46,671 INFO L93 Difference]: Finished difference Result 1285 states and 4924 transitions. [2021-06-05 04:35:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 04:35:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 04:35:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 04:35:46,673 INFO L225 Difference]: With dead ends: 1285 [2021-06-05 04:35:46,673 INFO L226 Difference]: Without dead ends: 1283 [2021-06-05 04:35:46,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1502.7ms TimeCoverageRelationStatistics Valid=277, Invalid=1129, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 04:35:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-06-05 04:35:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1028. [2021-06-05 04:35:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 3.9435248296007788) internal successors, (4050), 1027 states have internal predecessors, (4050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 4050 transitions. [2021-06-05 04:35:46,685 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 4050 transitions. Word has length 19 [2021-06-05 04:35:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 04:35:46,685 INFO L482 AbstractCegarLoop]: Abstraction has 1028 states and 4050 transitions. [2021-06-05 04:35:46,685 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 04:35:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 4050 transitions. [2021-06-05 04:35:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 04:35:46,687 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 04:35:46,687 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 04:35:46,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 541 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6397 [2021-06-05 04:35:46,887 INFO L430 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 04:35:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 04:35:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2006064512, now seen corresponding path program 395 times [2021-06-05 04:35:46,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 04:35:46,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984425726] [2021-06-05 04:35:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 04:35:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 04:35:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:46,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 04:35:46,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984425726] [2021-06-05 04:35:46,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984425726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:46,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551753401] [2021-06-05 04:35:46,969 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:46,996 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 04:35:46,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 04:35:46,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 04:35:46,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 04:35:47,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:47,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:47,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:47,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:47,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 04:35:47,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 04:35:47,132 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:51 [2021-06-05 04:35:47,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 04:35:47,206 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:47,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 04:35:47,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 04:35:47,209 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 04:35:47,229 INFO L628 ElimStorePlain]: treesize reduction 33, result has 35.3 percent of original size [2021-06-05 04:35:47,229 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 04:35:47,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 04:35:47,230 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:12 [2021-06-05 04:35:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 04:35:47,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551753401] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 04:35:47,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 04:35:47,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 04:35:47,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872892191] [2021-06-05 04:35:47,257 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 04:35:47,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 04:35:47,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 04:35:47,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 04:35:47,258 INFO L87 Difference]: Start difference. First operand 1028 states and 4050 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2021-06-05 04:35:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 04:35:47,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6407,542 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 04:35:47,578 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 04:35:47,580 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 04:35:47,582 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 04:35:47,582 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 04:35:47 BasicIcfg [2021-06-05 04:35:47,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 04:35:47,583 INFO L168 Benchmark]: Toolchain (without parser) took 796755.37 ms. Allocated memory was 348.1 MB in the beginning and 648.0 MB in the end (delta: 299.9 MB). Free memory was 327.2 MB in the beginning and 584.4 MB in the end (delta: -257.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 348.1 MB. Free memory was 328.6 MB in the beginning and 328.5 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 348.1 MB. Free memory was 327.2 MB in the beginning and 325.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L168 Benchmark]: Boogie Preprocessor took 16.29 ms. Allocated memory is still 348.1 MB. Free memory was 325.7 MB in the beginning and 324.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L168 Benchmark]: RCFGBuilder took 424.79 ms. Allocated memory is still 348.1 MB. Free memory was 324.6 MB in the beginning and 328.8 MB in the end (delta: -4.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L168 Benchmark]: TraceAbstraction took 796285.49 ms. Allocated memory was 348.1 MB in the beginning and 648.0 MB in the end (delta: 299.9 MB). Free memory was 328.8 MB in the beginning and 584.4 MB in the end (delta: -255.7 MB). Peak memory consumption was 44.2 MB. Max. memory is 16.0 GB. [2021-06-05 04:35:47,583 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 348.1 MB. Free memory was 328.6 MB in the beginning and 328.5 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.71 ms. Allocated memory is still 348.1 MB. Free memory was 327.2 MB in the beginning and 325.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 16.29 ms. Allocated memory is still 348.1 MB. Free memory was 325.7 MB in the beginning and 324.7 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 424.79 ms. Allocated memory is still 348.1 MB. Free memory was 324.6 MB in the beginning and 328.8 MB in the end (delta: -4.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 796285.49 ms. Allocated memory was 348.1 MB in the beginning and 648.0 MB in the end (delta: 299.9 MB). Free memory was 328.8 MB in the beginning and 584.4 MB in the end (delta: -255.7 MB). Peak memory consumption was 44.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1028states) and FLOYD_HOARE automaton (currently 7 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (164 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1028states) and FLOYD_HOARE automaton (currently 7 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (164 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (1028states) and FLOYD_HOARE automaton (currently 7 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (164 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1028states) and FLOYD_HOARE automaton (currently 7 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (164 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 796183.0ms, OverallIterations: 621, TraceHistogramMax: 2, EmptinessCheckTime: 483.0ms, AutomataDifference: 361809.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 19346 SDtfs, 43093 SDslu, 106688 SDs, 0 SdLazy, 249827 SolverSat, 5555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115531.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19077 GetRequests, 7364 SyntacticMatches, 511 SemanticMatches, 11202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32946 ImplicationChecksByTransitivity, 398109.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1071occurred in iteration=472, InterpolantAutomatonStates: 6714, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4204.4ms AutomataMinimizationTime, 620 MinimizatonAttempts, 64834 StatesRemovedByMinimization, 619 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2129.6ms SsaConstructionTime, 5842.4ms SatisfiabilityAnalysisTime, 301069.4ms InterpolantComputationTime, 20048 NumberOfCodeBlocks, 20048 NumberOfCodeBlocksAsserted, 1651 NumberOfCheckSat, 18886 ConstructedInterpolants, 500 QuantifiedInterpolants, 418382 SizeOfPredicates, 4756 NumberOfNonLiveVariables, 40496 ConjunctsInSsa, 10908 ConjunctsInUnsatCore, 1162 InterpolantComputations, 80 PerfectInterpolantSequences, 611/4546 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown